67 67 votes 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 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. Algorithms gatecse-2014-set2 algorithms graph-algorithms normal graph-search + – go_editor 19.0k views answer comment Share Follow Print See 1 comment 1 1 comment reply Siddharth_Perkar commented Jun 18 reply Follow flag Those edges jinhe hum use karte hain nodes ko explore karne ke liye, unhe hum "tree arcs" kehte hain. 2 2 replyShare Please log in or register to add a comment.
0 0 votes 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. varunrajarathnam answered Aug 7, 2020 varunrajarathnam comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Simply Draw BFT and check every statement Nitin_Dwivedi answered Jul 5, 2025 Nitin_Dwivedi comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes BFS + Unweighted Graph = Shortest paths from Source Option B : Shortest path frpm W to every Vertex in the Graph soudipta_dutta answered Jul 22, 2025 soudipta_dutta comment Share Follow 0 reply Please log in or register to add a comment.
