Question 10238 – Data-Structures
January 9, 2024Question 8683 – Set-Theory
January 9, 2024Question 8630 – Data-Structures
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
Correct Answer: B
Question 25 Explanation:
One of the application of BFS algorithm is to find the shortest path between nodes u and v.
But in the given question the BFS algorithm starts from the source vertex w and we can find the shortest path from W to every vertex of the graph.
But in the given question the BFS algorithm starts from the source vertex w and we can find the shortest path from W to every vertex of the graph.
the shortest path between every pair of vertices.
the shortest path from W to every vertex in the graph.
the shortest paths from W to only those nodes that are leaves of T.
the longest path in the graph.
Subscribe
Login
0 Comments