Graph verification

directed_graph.cpp

@@ -635,7 +635,7 @@ int _connected_vertices_count_recursive(DirectedGraph* graph, void* origin)
 
 /*
  * The source_vertex function takes a DirectedGraph* struct pointer parameter and
- * traverses the Directed Graph structure from each vertex. The vertex from which
+ * traverses the Directed Graph structure from each vertex. The first vertex from which
  * all vertices can be visited is returned. If no such vertex exists, then NULL
  * is returned.
  */
@@ -696,7 +696,7 @@ void set_visited_field(DirectedGraph* graph, bool value)
 }
 
 /*
- * The reset_parent_links function changes the parent reference of eac vertex struct
+ * The reset_parent_links function changes the parent reference of each vertex struct
  * within the DirectedGraph* struct to NULL.
  */
 /*
@@ -722,6 +722,7 @@ void reset_parent_links(DirectedGraph* graph)
  * accepts two vertex* structs as void*, casts them to Vertex*,
  * and compares them based on their distance data member.
  */
+/*
 int compareVertex(void* a, void* b)
 {
 	if(a == NULL || b == NULL)
@@ -733,7 +734,7 @@ int compareVertex(void* a, void* b)
 
 	return (int) v1->distance - v2->distance;
 }
-
+*/
 /*
  * This buildTree funciton implements dijkstra's algorithm. It takes a DirectedGraph* struct
  * pointer and a void* origin vertex struct pointer, then creates a shotest path list by