This module computes the lengths of the shortest paths from node 1 to all other nodes using the vanilla DP successive approximation method.
It can handle cyclic and acyclic problems and it does not care much whether the distances are negative or non-negative. This flexibility and versatility is not due to an algorithmic breakthrough but merely a reflection of the fact that we do not exclude cyclic paths. In other words, we do not restrict the feasible paths to be simple: we do allow feasible path to include cycles. This means that even though there are only finitely many cities, if the distances are allowed to be negative and there is a cycle whose length is negative, then the length of the shortest path could be unbounded from below. The module detects such cases.
More details on the DP Successive Approximation Method can be found in the lengthy paper on Dijkstra's Algorithm.
If you have not used this module before, you may have to have a quick look at the short help winodw before you begin your experiment.