graph.h

Go to the documentation of this file.

/*
 * Social Network uses graphs to represent relationships between users.
 * Copyright (C) 2025  Raphael Panaligan  Jek Degullado
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */

 
#ifdef __cplusplus
extern "C" {
#endif
 
#ifndef SOCIAL_NETWORK_GRAPH_H_
#define SOCIAL_NETWORK_GRAPH_H_
 
#include <stdbool.h>
#include <stddef.h>

#define MAX_VERTEX_LABEL_LENGTH 8

#define MAX_GRAPH_VERTEX_COUNT 20

typedef char Vertex[MAX_VERTEX_LABEL_LENGTH + 1];

typedef struct Graph {
    size_t vertex_count;
    Vertex adjacencies_by_vertex[MAX_GRAPH_VERTEX_COUNT][MAX_GRAPH_VERTEX_COUNT];
    size_t adjacencies_length;
} Graph;

void initialize_graph(Graph *const graph, const size_t vertex_count);

void clone_graph(const Graph *const graph, Graph *const new_graph);

size_t get_vertex_index(const Graph *const graph, const Vertex vertex);

bool has_vertex(const Graph *const graph, const Vertex vertex);

void add_adjacency(Graph *const graph, const Vertex key_vertex, const Vertex adjacent_vertex);

size_t get_adjacency_count(const Vertex adjacencies[MAX_GRAPH_VERTEX_COUNT]);

bool has_adjacency(const Vertex adjacencies[MAX_GRAPH_VERTEX_COUNT], const Vertex adjacent_vertex);

void sort_adjacencies(Graph *const graph);

typedef struct GraphEdge {
    Vertex source;
    Vertex destination;
} GraphEdge;

void get_edges(const Graph *const graph, GraphEdge edges[], size_t *const edge_count);

bool has_edge(const GraphEdge edges[], const size_t edge_count, const Vertex source_vertex,
              const Vertex destination_vertex);
 
#endif  // SOCIAL_NETWORK_GRAPH_H_
 
#ifdef __cplusplus
}
#endif