>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which shortest-path approach relaxes edges in topological order when the graph is directed and acyclic? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Hard
Which shortest-path approach relaxes edges in topological order when the graph is directed and acyclic?
Shortest paths
Graph algorithms
Choose your answer
A
DAG shortest paths
B
Bellman-Ford algorithm
C
Dijkstra's algorithm
D
Floyd-Warshall algorithm
Check answer
More in Algorithms →