tutORial's Dijkstra's Module

tutORial's Dijkstra's Module

This module provides support for the very famous Dijkstra's Algorithm.

We follow the long and established tradition of describing this algorithm in the context of the classical shortest path problem. So the problem is to determine the shortest path between two given nodes of a network. It is assumed that the length of the arcs are not negative.