graph

unidirected graph implementation using adjacency list
Index Commits Files Refs README LICENSE
commit b99e54745f24a3eca97315343094b97d56545ee2
parent 001cb7a10b5d360fde70d13c80fa129f6105115d
Author: mjkloeckner <martin.cachari@gmail.com>
Date:   Mon, 30 Jan 2023 23:43:27 -0300

removed TODO

Diffstat:
Mmain.c | 4----
1 file changed, 0 insertions(+), 4 deletions(-)
diff --git a/main.c b/main.c
@@ -131,10 +131,7 @@ void graph_print_gv(const Graph *G) {
 }
 
 /* non-recursive Depth-First Search */
-/* TODO: implement a stack data structure */
 void graph_dfs(const Graph *G, const Vertex *v) {
-    /* let S be a stack */
-    /* Vertex **S = calloc(100, sizeof(Vertex *)); */
     Stack *S;
     Vertex *aux;
     int x;
@@ -147,7 +144,6 @@ void graph_dfs(const Graph *G, const Vertex *v) {
 
         if (!aux->visited) {
             aux->visited = true;
-
             vertex_get_value(aux, &x);
             printf("%d -> ", x);