Add algorithm for simple cycles in a directed graph#126
Conversation
npcoder2k14
commented
Jan 21, 2020
- This Algorithm gives you all simple cycles present in a directed graph
- Implemented Algorithm as mentioned in https://www.cs.tufts.edu/comp/150GA/homeworks/hw1/Johnson%2075.PDF
Test: - Add test for the algorithm
|
Closing it since build failed on this one. |
|
|
@aysylu Can you suggest to me what am I doing wrong?
Some Bellman-ford tests are failing for me which I haven't even touched. |
Enumerate all simple cycles in a directed graph; returns ::not-a-directed-graph for undirected input. Ported with tests from aysylu#126.
Adds simple-paths (aysylu#111) and digraph-all-cycles (aysylu#126); perf for degeneracy-ordering (aysylu#108) and pre-traverse (aysylu#120).