Implementation of Dijkstra's algorithm

[Der Andere]

Do you know of an efficient implementation (priority queues) of Dijkstra's
algorithm for calculating the shortest distances between vertices in a
graph?

Cheers,
Matthias

--
Für emails Anweisung in der Adresse befolgen