add print_list

dfs.c

@@ -60,4 +60,16 @@ void clear_list(struct list_head *visited)
 		list_del(&n->list);
 		free(n);
 	}
+}
+
+void print_list_dfs(struct list_head *collection_of_nodes_and_stuff)
+{
+	struct node *n;
+
+	if (list_empty(collection_of_nodes_and_stuff))
+		return;
+
+	list_for_each_entry(n, collection_of_nodes_and_stuff, list) {
+		printf("path: %s\n", n->path);
+	}
 }
\ No newline at end of file

dfs.h

@@ -13,4 +13,5 @@ struct node *stack_dequeue(struct list_head *stack);
 void add_visited(struct node *n, struct list_head *visited);
 bool is_visited(char *path, struct list_head *visited);
 void clear_list(struct list_head *visited);
+void print_list_dfs(struct list_head *collection_of_nodes_and_stuff);
 #endif
\ No newline at end of file