>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which shortest-path algorithm repeatedly settles the nearest frontier vertex when all edge weights are nonnegative? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Hard
Which shortest-path algorithm repeatedly settles the nearest frontier vertex when all edge weights are nonnegative?
Shortest paths
Graph algorithms
Choose your answer
A
Dijkstra's algorithm
B
A-star search
C
Floyd-Warshall algorithm
D
Bellman-Ford algorithm
Check answer
More in Algorithms →