Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
Let G be a simple undirected graph, TD be a DFS tree on G, and TB be the BFS tree on G.
Consider the following statements.
Statement I: No edge of G is a cross with respect to TD
Statement II: For every edge (u, v) of G. if u is at depth i and v is at depth j in TB then |i - j| = 1. In the light of the above statements, choose the correct answer from the options given below
1
Both Statement I and Statement II are true
2
Both Statement I and Statement II are false
3
Statement I is correct but Statement II is false
4
Statement I is incorrect but Statement II is true