Anonymous user
Dijkstra's algorithm: Difference between revisions
→{{header|Prolog}}
Line 1,701:
=={{header|Prolog}}==
An
Dijkstra's algorithm starts with a set of all unvisited nodes, assigning an initial distance value for each as infinite. It then attempts to minimise the distance for each node from the origin.
| |||