paulpauls/cyclic-toposort

Implements sorting algorithm for directed acyclic as well as cyclic graphs. The directed cyclic graphs are sorted by determining the minimal amount of cyclic edges and optionally then also determining the maximum amount of groupings possible with a minimal amount of cyclic edges.

cyclic-toposort's Issues

Duplicates in cyclic_toposort

Hi Paul,

thank you for publishing this library. It is very useful for me! I was wondering why there are duplicates in the sorted edge list if I force a start node like this:

edges = {(0, 1), (1, 2), (2, 3), (3, 0)}
ct.cyclic_toposort(edges, start_node=1)

([1, 1, 2, 3, 0], {(0, 1)})

Thank you,
Jan