> For my example: > > A -- B -- C > > If I have computer the shortest path to B (from A and C). Then when I > am computing shortest paths to C, I do not need to search any node > behind the B, when I reach B.
Ok, perhaps a more complex example will clarify things: A -- B -- C -- D The shortest path from A to D is computed from the B -- C -- D path. At no point does A take into account the A -- B -- C path in order to compute the path to D. -- Juliusz _______________________________________________ Babel-users mailing list [email protected] http://lists.alioth.debian.org/mailman/listinfo/babel-users
