*Traversing a Directed Graph through DFS recursively*

*Traversing a Directed Graph through DFS recursively*

Write a C Program for traversing a Directed Graph through DFS recursively. Here’s simple C Program for traversing a Directed Graph through DFS recursively, visiting all the vertices.

**Depth First Search (DFS)**

Depth First Search (DFS) algorithm traverses a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search, when a dead end occurs in any iteration.

It employs the following rules.

**Rule 1**− Visit the adjacent unvisited vertex. Mark it as visited. Display it. Push it in a stack.**Rule 2**− If no adjacent vertex is found, pop up a vertex from the stack. (It will pop up all the vertices from the stack, which do not have adjacent vertices.)**Rule 3**− Repeat Rule 1 and Rule 2 until the stack is empty.

We shall not see the implementation of Depth First Traversal (or Depth First Search) in C programming language

**Also Read : : C Program to implement BFS Algorithm for Connected Graph**

Below is the source code for C Program for traversing a Directed Graph through DFS recursively which is successfully compiled and run on Windows System to produce desired output as shown below :

**SOURCE CODE : :**

**SOURCE CODE : :**

/* C Program for traversing a Directed Graph through DFS recursively */ #include<stdio.h> #define MAX 100 #define initial 1 #define visited 2 #define finished 3 int n; /*Number of vertices in the graph */ int adj[MAX][MAX]; void create_graph(); int state[MAX]; void DF_Traversal(); void DFS(int v); int main() { create_graph(); DF_Traversal(); return 0; }/*End of main()*/ void DF_Traversal() { int v; for(v=0; v<n; v++) state[v] = initial; printf("\nEnter starting vertex for Depth First Search : "); scanf("%d",&v); DFS(v); for(v=0; v<n; v++) { if(state[v] == initial) DFS(v); } printf("\n"); }/*End of DF_Traversal()*/ void DFS(int v) { int i; printf("%d ",v); state[v] = visited; for(i=0; i<n; i++) { if(adj[v][i] == 1 && state[i] == initial) DFS(i); } state[v] = finished; }/*End of DFS()*/ void create_graph() { int i,max_edges,origin,destin; printf("\nEnter number of vertices : "); scanf("%d",&n); max_edges = n*(n-1); for(i=1; i<=max_edges; i++) { printf("\nEnter edge %d( -1 -1 to quit ) : ",i); scanf("%d %d",&origin,&destin); if( (origin == -1) && (destin == -1) ) break; if( origin >= n || destin >= n || origin<0 || destin<0) { printf("\nInvalid edge!\n"); i--; } else { adj[origin][destin] = 1; } }/*End of for*/ }/*End of create_graph()*/

**OUTPUT : :**

**OUTPUT : :**

/* C Program for traversing a Directed Graph through DFS recursively */ Enter number of vertices : 5 Enter edge 1( -1 -1 to quit ) : 0 1 Enter edge 2( -1 -1 to quit ) : 0 2 Enter edge 3( -1 -1 to quit ) : 0 3 Enter edge 4( -1 -1 to quit ) : 1 3 Enter edge 5( -1 -1 to quit ) : 2 4 Enter edge 6( -1 -1 to quit ) : 4 3 Enter edge 7( -1 -1 to quit ) : -1 -1 Enter starting vertex for Depth First Search : 0 0 1 3 2 4 Process returned 0

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may * Contact Us* through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.

**Thanks for reading the post…**

**Recommended Posts : :**

**Recommended Posts : :**

- Traversing an Undirected Graph through DFS
- Traversing a directed graph through DFS
- DFS Algorithm for Connected Graph
- DFS Algorithm for Disconnected Graph
- BFS Algorithm for Connected Graph
- BFS Algorithm for Disconnected Graph

In DF_Traversal() , why did you choose to use v as the variable name for three different variables in the same function? I am curious as to the logic behind that decision and what effect it has.