Maximum flow algorithms which uses the
augmenting path approach, i.e. which repeatedly augments the flow
on an augmenting path until no such path can be found any more.
Convenience base class for decorators of graphs, i.e., classes which
implement a graph property and enhance the functionality of an inner
graph property object by intercepting calls to it.
Implements the classic Bellman-Ford algorithm
(search shortest paths by a label correcting algorithm which visits the
nodes in a FIFO order)
Requires OutgoingEdgeNeighborhoodGraphProp.
An algorithm to detect a cycle in a graph given by a predecessor map
(occurs as subproblem when negative cycles in shortest path trees shall
be identified).
An extended TraversalVisitor which allows to signal when a DFS traversal
leaves the current node (i.e. the complete set of nodes reachable from that
node has been explored).
Return a NodeMap which maps every node in the graph to its predecessor
(or null if no precedessor exists, e.g. for the source or because
the node has not been reached by the shortest path algorithm).
Round a given matrix such that the row sums and column sums are also
rounded to one of the two nearest integers, i.e., row sum 12.6 may
only become 12 or 13 but not 14.
If this flag is set to true, the underlying graph must have the
OutgoingEdgeNeighborhood-property and only outgoing edges will
be considered when the neigbors of a node are visited.