The ranking is implemented to start with a node that has no predecessors.
However not all the graphs has such nodes. The problem is then formulated
in the following way: we should be able to make any graph fully acyclic by
inverting some of its edges. If a graph has loop with no edge entering it
we should break the loop.
Original issue reported on code.google.com by boris...@gmail.com on 24 Jun 2009 at 8:30
Original issue reported on code.google.com by
boris...@gmail.com
on 24 Jun 2009 at 8:30