Revision as of 03:05, 11 June 2025 edit 2600:1700:3680:2540:31e3:60bf:e3c0:4d6a (talk) No edit summary ← Previous edit		Revision as of 15:08, 28 June 2025 edit undo 95.91.246.81 (talk) →Algorithm Tag: Reverted Next edit →
Line 18: == Algorithm == [[File:Dijkstras_progress_animation.gif\|thumb\|Illustration of Dijkstra's algorithm finding a path from a start node (lower left, red) to a target node (upper right, green) in a [[Robotics\|robot]] [[motion planning]] problem. Open nodes represent the "tentative" set (aka set of "unvisited" nodes). Filled nodes are the visited ones, with color representing the distance: the redder, the closer (to the start node). Nodes in all the different directions are explored uniformly, appearing more-or-less as a circular [[wavefront]] as Dijkstra's algorithm ~~uses~~does not use a [[Consistent heuristic\|heuristic]] of picking the shortest known path so far.]] The algorithm requires a starting node, and computes the shortest distance from that starting node to each other node. Dijkstra's algorithm starts with infinite distances and tries to improve them step by step:

Dijkstra's algorithm: Difference between revisions