Definition An instance algorithm of this class is an implementation of Dijkstra that can be flexibly initialized, stopped after each iteration of the core loop, and continued, time and again.
Usage is more complex and is documented in the graphiterator leda extension package.
The length and distance data accessors are initialized by the parameter list. The set of sources is empty. All edge lengths are initialized by values that are large enough to be taken as infinity. This precondition is not necessary for the algorithm to have a defined behavior. In fact, it may even make sense to break this precondition deliberately.