edited by
665 views
0 votes
0 votes
Consider the tree arcs of a DFS traversal from a source node W in an unweighted, connected, undirected, acyclic graph. The tree T formed by the tree arcs is a data structure for computing-
1. the shortest path between every pair of vertices.
2. the shortest path from W to every vertex in the graph.
3. the shortest paths from W to only those nodes that are leaves of T.
4. the longest path in the graph.
edited by

Please log in or register to answer this question.

Related questions