Fill in the algorithm's name.
# ____'s algorithm finds shortest paths with non-negative weights
Answer: Dijkstra
Dijkstra greedily expands the closest unvisited node.
Play Problem Solving ▸
# ____'s algorithm finds shortest paths with non-negative weights
Answer: Dijkstra