python - Detecting mulitple cycles in a cyclic directed graph -
I have a cyclic graph guided with more than one cycle and one way (and List) should exist in diagrams.
The graph can be seen here:
This is a dragon graph which is put together to debug my dragon script. There are cycles in:
[n13, n14], [n6, n8, n15, n16, n7], [n6, n8, n9, n7]
The algorithm must know each cycle in the Digraph, not only the smallest, nor the first it competes.
You did not actually specify how you represent the guided article, but you can see it.
Comments
Post a Comment