Maximal Non-branching path approach iterates through all nodes of the graph that are not 1-in-1-out nodes and generates all non-branching paths starting at each such node. In the final step, it finds all isolated cycles in the graph.
If you want to contact us you can reach out at TeamOutliers23@gmail.com.
This project uses the following license: MIT