Removes cycles from the input network using a Greedy-Cycle-Removal algorithm.
The idea is to induce an order on all nodes
in the network (U1, U2, U3, ..., Uk) such that for the majority of links L = (Ui, Uj)
it is true that i < j. All links L = (Ui, Uj) such that i > j are reversed.
Syntax
protected virtual void GreedyCycleRemoval()
See Also