Consider the tree arcs of a BFS traversal from a source node W in an…

PYQ GATE 2014

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

  1. A.

    the shortest path between every pair of vertices.

  2. B.

    the shortest path from W to every vertex in the graph.

  3. C.

    the shortest paths from W to only those nodes that are leaves of T.

  4. D.

    the longest path in the graph.

Attempted by 503 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…