FindingAllSpanningTrees This code first generates all spanning trees of a graph, using algorithm from Sorensen and Jannsen Then generates all cut sets depending on these spanning trees using algorithm from Sanjeev Saxena