Jos van Uden:
Somebody added an incorrect notice to the D entry for Dijkstra's algorithm.
The task requires a directed graph:1. Implement a version of Dijkstra's algorithm that computes a shortest path from a start vertex to an end vertex in a directed graph.
So I have fixed the graph. Bye, bearophile
