Print the DFS traversal step wise

// C Program 
// Print the DFS traversal step wise
#include <stdio.h>

#include <stdlib.h>

// Define edge of graph node
struct AjlistNode
{
	int id; //Vertices id
	struct AjlistNode *next;
};
// Define node of graph 
struct GraphNode
{
	int data; //node key value
	struct AjlistNode *edge;
};
// Define structure of graph
struct MyGraph
{
	int size; // Number of graph nodes
	struct GraphNode *node;
};
// This are return a new graph with given number of nodes
struct MyGraph *newGraph(int size)
{
	if (size < 0)
	{
		printf("\n Invalid size of nodes %d \n", size);
		return NULL;
	}
	// Create a graph
	struct MyGraph *graph = (struct MyGraph *) malloc(sizeof(struct MyGraph));
	if (graph != NULL)
	{
		// Set node size
		graph->size = size;
		// Allocate memory to graph node
		graph->node = (struct GraphNode *) malloc(sizeof(struct GraphNode) *size);
		// Loop controlling variable
		int i = 0;
		// Set graph node level and e
		for (i = 0; i < graph->size; i++)
		{
			// Set node level (0...size-1)
			graph->node[i].data = i;
			// Set the node [i] have no edge
			graph->node[i].edge = NULL;
		}
	}
	else
	{
		printf("\n Graph of nodes %d is not created (memory overflow problem)\n", size);
	}
	return graph;
}
//This function are connect nodes with one edge 
void connect_edge(struct MyGraph *graph, int a, int b)
{
	if (graph->node == NULL)
	{
		printf("\n Graph have no nodes \n");
		return;
	}
	// Create Adjacency node
	struct AjlistNode *newEdge = (struct AjlistNode *) malloc(sizeof(struct AjlistNode));
	if (newEdge != NULL)
	{
		newEdge->next = NULL;
		newEdge->id = b;
		// Get first edge of [i] node
		struct AjlistNode *edge = graph->node[a].edge;
		if (edge == NULL)
		{
			// Whe no edge of graph node [i] then
			// Add a first edge of a [i] node
			graph->node[a].edge = newEdge;
		}
		else
		{
			//Find last location to add new edge
			while (edge->next != NULL)
			{
				edge = edge->next;
			}
			// Add edge at last position
			edge->next = newEdge;
		}
	}
	else
	{
		printf("\nMemory overflow, when connect a new edge from ( %d to %d ) nodes.\n", a, b);
	}
}
// This is handles the request of connecting Edges between given node a to b
void add_edge(struct MyGraph *graph, int a, int b)
{
	if (a < graph->size && b < graph->size)
	{
		// connect edge
		// a---->b
		connect_edge(graph, a, b);
		if (a == b)
		{
			//self loop
			return;
		}
		// connect edge
		// a <---- b
		connect_edge(graph, b, a);
	}
	else
	{
		//not valid Vertices
		printf("Invalid Node Vertices %d  %d", a, b);
	}
}
//Display Adjacency list of vertex
void print_graph(struct MyGraph *graph)
{
	if (graph->node != NULL)
	{
		struct AjlistNode *temp = NULL;
		// Loop controlling variable
		int i = 0;
		for (i = 0; i < graph->size; i++)
		{
			printf("\n Adjacency list of vertex %d  :", i);
			// Get first edge of [i] node
			temp = graph->node[i].edge;
			while (temp != NULL)
			{
				//temp->id is graph node vertices
				//in this case temp->id is same as 
				//node[temp->id].data
				printf("  %d", graph->node[temp->id].data);
				temp = temp->next;
			}
		}
	}
	else
	{
		printf("Empty GraphNode");
	}
}
// Print all steps process in dfs
void print_dfs(struct MyGraph *graph, int visit[], int i)
{
	if (i >= graph->size || visit[i] == 1)
	{
		return;
	}
	struct AjlistNode *temp = graph->node[i].edge;
	visit[i] = 1;
	while (temp != NULL)
	{
		if (visit[temp->id] == 0)
		{
			printf("  %d", i);
			print_dfs(graph, visit, temp->id);
		}
		temp = temp->next;
	}
	printf("  %d", i);
}
// handles the request of find all steps in DFS process
void dfs(struct MyGraph *graph)
{
	if (graph->size > 0)
	{
		int visit[graph->size];
		for (int i = 0; i < graph->size; ++i)
		{
			visit[i] = 0;
		}
		printf("\n DFS \n");
		print_dfs(graph, visit, 0);
	}
}
int main()
{
	struct MyGraph *graph = newGraph(11);
	//Connected two node with Edges
	add_edge(graph, 0, 1);
	add_edge(graph, 0, 2);
	add_edge(graph, 0, 3);
	add_edge(graph, 1, 5);
	add_edge(graph, 2, 9);
	add_edge(graph, 3, 8);
	add_edge(graph, 4, 9);
	add_edge(graph, 5, 6);
	add_edge(graph, 6, 7);
	add_edge(graph, 6, 10);
	add_edge(graph, 7, 10);
	print_graph(graph);
	dfs(graph);
	return 0;
}

Output

 Adjacency list of vertex 0  :  1  2  3
 Adjacency list of vertex 1  :  0  5
 Adjacency list of vertex 2  :  0  9
 Adjacency list of vertex 3  :  0  8
 Adjacency list of vertex 4  :  9
 Adjacency list of vertex 5  :  1  6
 Adjacency list of vertex 6  :  5  7  10
 Adjacency list of vertex 7  :  6  10
 Adjacency list of vertex 8  :  3
 Adjacency list of vertex 9  :  2  4
 Adjacency list of vertex 10  :  6  7
 DFS
  0  1  5  6  7  10  7  6  5  1  0  2  9  4  9  2  0  3  8  3  0