$ ./guess_the_languageProblem Solving — fill the blank
Problem Solving — fill the blank · hard · #79

Fill in the algorithm's name.

# ____'s algorithm finds shortest paths with non-negative weights

Answer: Dijkstra (also accepted: dijkstra, dijkstras, dijkstra's)

Dijkstra greedily expands the closest unvisited node.
Play Problem Solving ▸