For each vertex with positive excess and non-infinite distance label, push flow excess to adjacent vertices with smaller distance labels along edges with remaining capacity. Do an occasional search to keep distance labels current. Stop when all flow excess is at vertices with infinite distance labels. Push excess flow back to source. It was not written by the implementor.
Contributions are welcome.
The fields in each line type are as follows. Input files for matflow present a complete undirected graph as the upper-triangular part of an integer distance matrix. First line corresponds to vertex 1. Terminates with newline. Second line corresponds to vertex 2.