Consider the tree arcs of a BFS traversal from a source node W in an…
GATE · 2014 · CS · Set 2 · Computer Science & IT
Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing
- A.
the shortest path between every pair of vertices.
- B.
the shortest path from W to every vertex in the graph.
- C.
the shortest paths from W to only those nodes that are leaves of T.
- D.
the longest path in the graph.
Attempted by 421 students.
Sign up free to check your answer
Sign up freeLoading lesson…