digraph/directed_graph.c
/*
 * The connected_vertices_count function takes a DirectedGraph* struct pointer and a void* 
 * pointer to a vertex, calls a helper recursive function, resets all the vertices visited
 * field to false, and returns the count of the vertices traversable from the void* origin
 * vertex. 
 */
The connected_vertices_count function takes a DirectedGraph* struct pointer and a void
pointer to a vertex, calls a helper recursive function, resets all the vertices visited
field to false, and returns the count of the vertices traversable from the void* origin
vertex.
The connected_vertices_count function takes a DirectedGraph * struct pointer and a void pointer to a vertex calls a helper recursive function resets all the vertices visited field to false and returns the count of the vertices traversable from the void * origin vertex .
int connected_vertices_count(DirectedGraph* graph, void* origin)
{
	if(graph == NULL || origin == NULL)
		return -1;
	int count  = _connected_vertices_count_recursive(graph, origin) - 1; 	
	set_visited_field(graph, false);
	return count;
}
int connected_vertices_count ( DirectedGraph * graph , void * origin ) { if ( graph == NULL || origin == NULL ) return -1 ; int count = _connected_vertices_count_recursive ( graph , origin ) - 1 ; set_visited_field ( graph , false ) ; return count ; }
The connected_vertices_count function takes a DirectedGraph* struct pointer and a void
 pointer to a vertex, calls a helper recursive function, resets all the vertices visited
 field to false, and returns the count of the vertices traversable from the void* origin
 vertex.
The connected_vertices_count function takes a DirectedGraph * struct pointer and a void pointer to a vertex calls a helper recursive function resets all the vertices visited field to false and returns the count of the vertices traversable from the void * origin vertex .