Q122
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
A.
O(|E||V|)
B.
O(|E|)
C.
O(|E| log |V|)
D.
O(|E|2|V|)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board