Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
Consider the following undirected graph.
Which sequence corresponds to that of the DFS of the above graph. Consider search starts at a vertex 0 and follows lexicographic ordering for the edges produced from each vertex.
1
0 1 2 6 3 4 5
2
0 1 2 3 4 5 6
3
0 1 2 5 3 4 6
4
0 1 2 3 5 6 4