5 Vertices U V Different Trees Depth First Forest U V Must Connected True B False 6 Depth Q43828692
5. If vertices u and v are in different trees of the depth-firstforest, then u and v must not be connected.
a. True
b. False
6.
A depth-first tree is always different from a breadth-first treerooted at the same vertex for the same graph G.
a. Trueb. False
7.
Using which one of the following data structures can weimplement Dijkstra’s shortest path algorithm on unweighted graphsso that it runs in linear time?
a. Binary Treeb. Stackc. Queued. Heap
8.
Given a directed graph with negative edge weights, Dijkstra’salgorithm is capable of finding the shortest path between twonodes.
a. Trueb. False
Expert Answer
Answer to 5. If vertices u and v are in different trees of the depth-first forest, then u and v must not be connected. a. True b. …
OR