Dijkstra's algorithm: Difference between revisions
→{{header|Commodore BASIC}}
Line 1,474:
=={{header|Commodore BASIC}}==
This should work on any Commodore 8-bit BASIC from V2 on; with
(The program outputs the shortest path to each node in the graph, including E and F, so I assume that meets the requirements of Task item 3.)
| |||