Skip to main content
Loading page content
Explore
Learnings
Mental Math
Dashboard
More
Algo
Flow
Visualizers
Learnings
Quizzes
Mental Math
Dashboard
Log in
Sign up
Loading quiz challenge
Back to Visualizer
Question 1 of 5
Shortest Path
• Dijkstra Algorithm
What type of graphs is Dijkstra's algorithm designed to work correctly on?
A
Graphs with negative edge weights only
B
Graphs with non-negative edge weights
C
Only unweighted graphs
D
Only directed acyclic graphs