Multiple ChoiceHard 30s
Dijkstra's Algorithm
Dijkstra's algorithm finds the shortest path in a graph with:
Options
- 1Negative edge weights
- 2Non-negative edge weights
- 3Cycles only
- 4Unweighted edges only
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.