This package is a C++ implementation of various shortest path
algorithms based on Bellman-Ford's general strategy.

All programs works as filters, reading from stdin a graph in the
extended format of the First DIMACS Implementation Challenge
(ftp://dimacs.rutgers.edu/Challenges) and printing the distance and
the parent of each node in the tree of shortest paths.  Some
performance figures are also printed to stderr.

Note that the input format leads to a very slow parsing mechanism;
reading it in would be usually 10 times slower than solving the
problem, so we have defined a binary format that is much easier to
parse in.  The programs in2bin makes the conversions from and to this
format; it can also remove negative cycles from the graph, by
increasing the cost of arcs that close negative cycles.  Note,
however, that the binary format is totally platform-dependent; if you
need entries to be portable across platforms, use the text format.

Although these programs were implemented as part of a course on
Graphs, Shortest Paths and Networks Flows, the implementations ended
up as fast as optimized versions of the SPLIB package, by Boris
Cherkassky (cher@ch.comrel.msk.su), Andrew Goldberg
(goldberg@cs.stanford.edu), and Tomasz Radzik (radzik@cs.cornell.edu).
