>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which single-source shortest-path algorithm repeatedly relaxes all edges and can detect reachable negative cycles? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Hard
Which single-source shortest-path algorithm repeatedly relaxes all edges and can detect reachable negative cycles?
Shortest paths
Graph algorithms
Choose your answer
A
DAG shortest paths
B
A-star search
C
Floyd-Warshall algorithm
D
Bellman-Ford algorithm
Check answer
More in Algorithms →