Here is a c program to describe the DFS (Depth First Search). Depth First Search is an algorithm which is used to search a Tree or Graph in the programming language. It starts from the Root node and then starts traversing to the next level of Tree and Graph.
Copy the below program and execute it with the help of turbo c or TC bin to see the output.
printf("Enter number of vertices:");
//read the adjecency matrix
printf("\nEnter adjecency matrix of the graph:");
//visited is initialized to zero
void DFS(int i)
Enter number of vertices:2
Enter adjecency matrix of the graph:12
If you like FreeWebMentor and you would like to contribute, you can write an article and mail your article to [email protected] Your article will appear on the FreeWebMentor main page and help other developers.
Article Tags: c program for depth first search, c programs, c programs with solutions, depth first search c program, depth first search program, depth first search program in c, list of important c programs