An extension of the revised matrix algorithm

The revised matrix algorithm, which usually means one forward process followed by one backward process or three forward processes, is one of the best algorithms for finding all shortest paths in a net with nonnegative arcs. It is shown that the algorithm can also be applied to a net with negative arcs but with no negative circuit and that the order of matrix calculations can be reversed to one backward process followed by one forward process or three backward processes