# DFS Algorithm using Recursion C Program

By | October 1, 2016

## C Program for DFS Algorithm using Recursion

Learn How To Implement DFS Algorithm using Recursion in C Programming. This DFS Algorithm in C Programming makes use of Adjacency Matrix and Recursion method.

Must Read: C Program For Implement Prim’s Algorithm To Find MST

#### What is DFS Algorithm?

DFS Algorithm is an abbreviation for Depth First Search Algorithm. This DFS method using Adjacency Matrix is used to traverse a graph using Recursive method. Any given path in a graph is traversed until a dead end occurs after which backtracking is done to find the unvisited vertices and then traverse them too.

In the recursive algorithm for Depth First Search C Program, we have to take all the three vertex states viz., initial, visited and finished. Initially, all the vertices have its status as initial. When a vertex is visited, its state is changed to visited. The status of a vertex becomes finished when we backtrack from it.

Must Read: C Program To Implement Depth First Search Algorithm using Stack

#### C Program To Implement DFS Algorithm using Recursion and Adjacency Matrix

Must Read: C Program To Implement Christofides Algorithm

#### Output

In case you get any Compilation Errors or any doubts in this C Program For Depth First Search Algorithm using Recursion for Traversal of a Graph, let us know about it in the Comment Section below. Find more about this algorithm on GeeksForGeeks.

## 2 thoughts on “DFS Algorithm using Recursion C Program”

1. Naresh Vidhate

Thanks for this DFS Program in C. Finally I got a complete code.

2. Ganesh Jadhav

Why have you used %3d in this DFS C program?