32#ifndef SOCIAL_NETWORK_TRAVERSAL_H_
33#define SOCIAL_NETWORK_TRAVERSAL_H_
The helper functions that are used for handling and interacting with graphs and their vertices.
#define MAX_GRAPH_VERTEX_COUNT
The maximum number of vertices a graph can contain.
Definition graph.h:41
char Vertex[MAX_VERTEX_LABEL_LENGTH+1]
A string-labeled vertex in a graph.
Definition graph.h:44
A collection implementing the adjacency list data graph structure using arrays.
Definition graph.h:50
void depth_first_search(const Graph *const graph, const Vertex starting_vertex, Vertex visited_vertices[MAX_GRAPH_VERTEX_COUNT], size_t *const visited_vertex_cnt)
Traverses through all of a graph’s connected vertices starting from a specific vertex.
void breadth_first_search(const Graph *const graph, const Vertex starting_vertex, Vertex visited_vertices[MAX_GRAPH_VERTEX_COUNT], size_t *const visited_vertex_count)
Traverses through all of a graph’s connected vertices starting from a specific vertex.