Depth First Search (DFS) has been discussed in this article which uses adjacency list for the graph representation. In this article, adjacency matrix will be used to represent the graph.
Adjacency matrix representation: In adjacency matrix representation of a graph, the matrix mat of size n*n (where n is the number of vertices) will represent the edges of the graph where mat[i][j] = 1 represents that there is an edge between the vertices i and j while mat[i][i] = 0 represents that there is no edge between the vertices i and j.
Below is the adjacency matrix representation of the graph shown in the above image:
0 1 2 3 4 0 0 1 1 1 1 1 1 0 0 0 0 2 1 0 0 0 0 3 1 0 0 0 0 4 1 0 0 0 0
Input: source = 0 Output: 0 1 3 2 Input: source = 0 Output: 0 1 2 3 4
- Create a matrix of size n*n where every element is 0 representing there is no edge in the graph.
- Now, for every edge of the graph between the vertices i and j set mat[i][j] = 1.
- After the adjacency matrix has been created and filled, call the recursive function for the source i.e. vertex 0 that will recursively call the same function for all the vertices adjacent to it.
- Also, keep an array to keep track of the visited vertices i.e. visited[i] = true represents that vertex i has been been visited before and the DFS function for some already visited node need not be called.
Below is the implementation of the above approach:
0 1 2 3 4
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Implementation of BFS using adjacency matrix
- Prim's Algorithm (Simple Implementation for Adjacency Matrix Representation)
- Kruskal's Algorithm (Simple Implementation for Adjacency Matrix)
- Add and Remove vertex in Adjacency Matrix representation of Graph
- C program to implement Adjacency Matrix of a given Graph
- Add and Remove Edge in Adjacency Matrix representation of a Graph
- Find the number of islands | Set 1 (Using DFS)
- Check if a graph is strongly connected | Set 1 (Kosaraju using DFS)
- Calculate number of nodes in all subtrees | Using DFS
- Diameter of a tree using DFS
- DFS traversal of a tree using recursion
- Subtree of all nodes in a tree using DFS
- Level with maximum number of nodes using DFS in a N-ary tree
- Count the number of nodes at a given level in a tree using DFS
- Construct the Rooted tree by using start and finish time of its DFS traversal
- Kth ancestor of all nodes in an N-ary tree using DFS
- Minimum number of edges between two vertices of a graph using DFS
- Print all leaf nodes of an n-ary tree using DFS
- Check if a given graph is Bipartite using DFS
- BFS vs DFS for Binary Tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.