What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges? Correct Answer O(|E|2|V|)
Each augmenting step takes O(|E|) using an unweighted shortest path algorithm yielding a O(|E|2|V|) bound on the running time.
মোঃ আরিফুল ইসলাম
Feb 20, 2025