>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which all-pairs shortest-path algorithm considers each vertex in turn as an allowed intermediate vertex? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Hard
Which all-pairs shortest-path algorithm considers each vertex in turn as an allowed intermediate vertex?
Shortest paths
Graph algorithms
Choose your answer
A
Floyd-Warshall algorithm
B
Dijkstra's algorithm
C
DAG shortest paths
D
A-star search
Check answer
More in Algorithms →