Every edge may be of three different kinds: Advancing, Retreating and Cross.
Returns a DFOrdering for the graph encoded by the adjacency relation r
, set of nodes in nodes
and
set of initial nodes in entries
.
Returns the DFOrdering for a finite equation system.
The companion class for a DFOrdering defines the required enumerations and factory methods.