Dijkstra's algorithm

Applies to: general, robotics

Dijkstra's algorithm finds minimum-cost paths in graphs with non-negative edge costs.

pop cheapest node, relax neighbors

See also: graph, priority-queue, astar