Ejemplo n.º 1
0
        public static UndirectedGraph <int, Edge <int> > ParseFile(string path, bool kernelize)
        {
            var          g          = new UndirectedGraph <int, Edge <int> >(false);
            StreamReader sr         = new StreamReader(new BufferedStream(File.OpenRead(path)));
            var          verticeSet = new HashSet <int>();

            while (!sr.EndOfStream)
            {
                string line = sr.ReadLine();
                if (line == null)
                {
                    break;
                }
                var edgeString = line.Split(' ');
                var edge       = new[] { int.Parse(edgeString[0]), int.Parse(edgeString[1]) };
                g.AddVertexRange(edge);
                g.AddEdge(new Edge <int>(edge[0], edge[1]));
            }
            if (kernelize && File.Exists(path + "kernel"))
            {
                sr = new StreamReader(new BufferedStream(File.OpenRead(path + "kernel")));
                while (!sr.EndOfStream)
                {
                    string line = sr.ReadLine();
                    if (line == null)
                    {
                        break;
                    }
                    var v = int.Parse(line);
                    verticeSet.Add(v);
                }
            }
            var g2 = Faster.CloneGraph(g);

            if (verticeSet.Count > 0)
            {
                foreach (int v in g.Vertices)
                {
                    if (!verticeSet.Contains(v))
                    {
                        g2.RemoveVertex(v);
                    }
                }
            }

            return(g2);
        }
Ejemplo n.º 2
0
        static void Main(string[] args)
        {
            //TestGraphs.testAllGraphs();
            TestGraphs.Tests();
            //var graph1 = parse(args[0], true);
            //var graph2 = parseFile(args[0], false);
            //var graph = TestGraphs.TestGraph8();
            //var k1 = Faster.Run(graph1);
            UndirectedGraph <int, Edge <int> > graph = null;

            if (args.Length > 0)
            {
                graph = ParseFile(args[0], false);
            }
            else
            {
                graph = ReadGraph();
            }
            DrawGraph.drawGraph(graph, new HashSet <Edge <int> >(), @"C:\Users\Frederik\Downloads\instances\1.dot");
            Tuple <int, HashSet <Edge <int> > > a = Faster.Run(graph);
            var k       = a.Item1;
            var edgeSet = a.Item2;

            //Idiot check
            graph.AddEdgeRange(edgeSet);
            var analysis = MoplexAnalysis.AnalyseGraph(graph, null, null);

            if (!Faster.IsChordal2(analysis, graph))
            {
                //var x = Faster.FindFourCycle2(graph);
                throw new Exception("Idiot check went terribly wrong");
            }
            //Console.WriteLine($"Graph: {args[0].Split('\\').Last()} has k={k}");
            //Console.ReadLine();
            PrintSolution(edgeSet);
        }
Ejemplo n.º 3
0
        public static void Tests()
        {
            //Kernel tests
            //TestGraph 1
            var noKernel   = Faster.Run(TestGraph1());
            var withKernel = Faster.RunWithKernel(TestGraph1());

            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph1");
            }
            var noKernelTestGraph   = TestGraph1();
            var withKernelTestGraph = TestGraph1();

            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            var noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            var withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);

            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph1");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph1");
            }

            //TestGraph2
            noKernel   = Faster.Run(TestGraph2());
            withKernel = Faster.RunWithKernel(TestGraph2());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph2");
            }
            noKernelTestGraph   = TestGraph2();
            withKernelTestGraph = TestGraph2();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph2");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph2");
            }

            //TestGraph3
            noKernel   = Faster.Run(TestGraph3());
            withKernel = Faster.RunWithKernel(TestGraph3());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph3");
            }
            noKernelTestGraph   = TestGraph3();
            withKernelTestGraph = TestGraph3();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph3");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph3");
            }

            //TestGraph4
            noKernel   = Faster.Run(TestGraph4());
            withKernel = Faster.RunWithKernel(TestGraph4());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph4");
            }
            noKernelTestGraph   = TestGraph4();
            withKernelTestGraph = TestGraph4();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph4");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph4");
            }

            //TestGraph5
            noKernel   = Faster.Run(TestGraph5());
            withKernel = Faster.RunWithKernel(TestGraph5());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph5");
            }
            noKernelTestGraph   = TestGraph5();
            withKernelTestGraph = TestGraph5();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph5");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph5");
            }

            //TestGraph6
            noKernel   = Faster.Run(TestGraph6());
            withKernel = Faster.RunWithKernel(TestGraph6());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph6");
            }
            noKernelTestGraph   = TestGraph6();
            withKernelTestGraph = TestGraph6();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph6");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph6");
            }


            //TestGraph7
            noKernel   = Faster.Run(TestGraph7());
            withKernel = Faster.RunWithKernel(TestGraph7());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph7");
            }
            noKernelTestGraph   = TestGraph7();
            withKernelTestGraph = TestGraph7();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph7");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph7");
            }


            //TestGraph8
            noKernel   = Faster.Run(TestGraph8());
            withKernel = Faster.RunWithKernel(TestGraph8());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph8");
            }
            noKernelTestGraph   = TestGraph8();
            withKernelTestGraph = TestGraph8();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph8");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph8");
            }


            //TestGraph9
            noKernel   = Faster.Run(TestGraph9());
            withKernel = Faster.RunWithKernel(TestGraph9());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph9");
            }
            noKernelTestGraph   = TestGraph9();
            withKernelTestGraph = TestGraph9();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph9");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph9");
            }


            //TestGraph10
            noKernel   = Faster.Run(TestGraph10());
            withKernel = Faster.RunWithKernel(TestGraph10());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph10");
            }
            noKernelTestGraph   = TestGraph10();
            withKernelTestGraph = TestGraph10();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph10");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph10");
            }


            //TestGraph11
            noKernel   = Faster.Run(TestGraph11());
            withKernel = Faster.RunWithKernel(TestGraph11());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph11");
            }
            noKernelTestGraph   = TestGraph11();
            withKernelTestGraph = TestGraph11();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph11");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph11");
            }


            //TestGraph12
            noKernel   = Faster.Run(TestGraph12());
            withKernel = Faster.RunWithKernel(TestGraph12());
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test TestGraph12");
            }
            noKernelTestGraph   = TestGraph12();
            withKernelTestGraph = TestGraph12();
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal TestGraph12");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal TestGraph12");
            }

            //Test of external graph20.graph
            var graph1 = Program.ParseFile(@"..\..\testdata\20.graph", false);
            var graph2 = Program.ParseFile(@"..\..\testdata\20.graph", false);

            noKernel   = Faster.Run(graph1);
            withKernel = Faster.RunWithKernel(graph2);
            if (noKernel.Item1 != withKernel.Item1)
            {
                throw new Exception("different k in kernel test graph20.graph");
            }
            noKernelTestGraph   = Program.ParseFile(@"..\..\testdata\20.graph", false);
            withKernelTestGraph = Program.ParseFile(@"..\..\testdata\20.graph", false);
            noKernelTestGraph.AddEdgeRange(noKernel.Item2);
            withKernelTestGraph.AddEdgeRange(withKernel.Item2);
            noKernelAnalysis   = MoplexAnalysis.AnalyseGraph(noKernelTestGraph, null, null);
            withKernelAnalysis = MoplexAnalysis.AnalyseGraph(withKernelTestGraph, null, null);
            if (!Faster.IsChordal2(noKernelAnalysis, noKernelTestGraph))
            {
                throw new Exception("nokernel is not chordal graph20.graph");
            }
            if (!Faster.IsChordal2(withKernelAnalysis, withKernelTestGraph))
            {
                throw new Exception("withkernel is not chordal graph20.graph");
            }


            Console.WriteLine("kernel tests succeeded");

            //v* tests
            var analysis = MoplexAnalysis.AnalyseGraph(TestGraphs.TestGraph2(), null, null);
            var vStar    = Faster.FindVStar(new Edge <int>(0, 7), new HashSet <int>(TestGraphs.TestGraph2().Vertices), TestGraphs.TestGraph2());

            if (vStar != 6)
            {
                throw new Exception("Error in VStar");
            }

            analysis = MoplexAnalysis.AnalyseGraph(TestGraphs.TestGraph8(), null, null);
            if (analysis.Moplexes.Count != 5)
            {
                throw new Exception("Error in findmoplex without previous");
            }

            analysis = MoplexAnalysis.AnalyseGraph(TestGraphs.TestGraph9(), new List <Edge <int> > {
                new Edge <int>(0, 4)
            }, analysis.Moplexes);
            if (analysis.Moplexes.Count != 3)
            {
                throw new Exception("Error in findmoplex with previous");
            }


            analysis = MoplexAnalysis.AnalyseGraph(TestGraphs.TestGraph10(), null, null);
            if (analysis.Moplexes.Count != 2)
            {
                throw new Exception("Error in findmoplex without previous");
            }

            analysis = MoplexAnalysis.AnalyseGraph(TestGraphs.TestGraph5(), null, null);
            if (analysis.Moplexes.Count != 4)
            {
                throw new Exception("Error in findmoplex without previous");
            }

            analysis = MoplexAnalysis.AnalyseGraph(TestGraphs.TestGraph11(), new List <Edge <int> > {
                new Edge <int>(0, 4)
            }, analysis.Moplexes);
            if (analysis.Moplexes.Count != 3)
            {
                throw new Exception("Error in findmoplex without previous");
            }

            //four cycle test
            var a = Faster.FindFourCycle1(TestGraphs.TestGraph2());
            var b = Faster.FindFourCycle2(TestGraphs.TestGraph2());
            var c = Faster.FindFourCycle3(TestGraphs.TestGraph2());

            if (a != b && !a.SequenceEqual(b))
            {
                throw new Exception("difference between findFourCycle1 & 2");
            }
            if (a != c && !a.SequenceEqual(c))
            {
                throw new Exception("difference between findFourCycle1 & 3");
            }
            a = Faster.FindFourCycle1(TestGraphs.TestGraph4());
            b = Faster.FindFourCycle2(TestGraphs.TestGraph4());
            c = Faster.FindFourCycle3(TestGraphs.TestGraph4());
            if (a != b && !a.SequenceEqual(b))
            {
                throw new Exception("difference between findFourCycle1 & 2");
            }
            if (a != c && !a.SequenceEqual(c))
            {
                throw new Exception("difference between findFourCycle1 & 3");
            }
            a = Faster.FindFourCycle1(TestGraphs.TestGraph5());
            b = Faster.FindFourCycle2(TestGraphs.TestGraph5());
            c = Faster.FindFourCycle3(TestGraphs.TestGraph5());
            if (a != b && !a.SequenceEqual(b))
            {
                throw new Exception("difference between findFourCycle1 & 2");
            }
            if (a != c && !a.SequenceEqual(c))
            {
                throw new Exception("difference between findFourCycle1 & 3");
            }
            a = Faster.FindFourCycle1(TestGraphs.TestGraph6());
            b = Faster.FindFourCycle2(TestGraphs.TestGraph6());
            c = Faster.FindFourCycle3(TestGraphs.TestGraph6());
            if (a != b && !a.SequenceEqual(b))
            {
                throw new Exception("difference between findFourCycle1 & 2");
            }
            if (a != c && !a.SequenceEqual(c))
            {
                throw new Exception("difference between findFourCycle1 & 3");
            }
            //var g = TestGraph8reorder(); //weirdness test TODO needs fix or convincing argument for why not
            //a = Faster.FindFourCycle1(g);
            //b = Faster.FindFourCycle2(g);
            //c = Faster.FindFourCycle3(g);
            //if (a != b && !a.SequenceEqual(b))
            //    throw new Exception("difference between findFourCycle1 & 2");
            //if (a != c && !a.SequenceEqual(c))
            //    throw new Exception("difference between findFourCycle1 & 3");

            a = Faster.FindFourCycle1(TestGraphs.TestGraph8());
            b = Faster.FindFourCycle2(TestGraphs.TestGraph8());
            c = Faster.FindFourCycle3(TestGraphs.TestGraph8());
            if (a != b && !a.SequenceEqual(b))
            {
                throw new Exception("difference between findFourCycle1 & 2");
            }
            if (a != c && !a.SequenceEqual(c))
            {
                throw new Exception("difference between findFourCycle1 & 3");
            }
            a = Faster.FindFourCycle1(TestGraphs.TestGraph13());
            b = Faster.FindFourCycle2(TestGraphs.TestGraph13());
            c = Faster.FindFourCycle3(TestGraphs.TestGraph13());
            if (a != b && !a.SequenceEqual(b))
            {
                throw new Exception("difference between findFourCycle1 & 2");
            }
            if (a != c && !a.SequenceEqual(c))
            {
                throw new Exception("difference between findFourCycle1 & 3");
            }
            a = Faster.FindFourCycle1(TestGraphs.TestGraph14());
            b = Faster.FindFourCycle2(TestGraphs.TestGraph14());
            c = Faster.FindFourCycle3(TestGraphs.TestGraph14());
            if (a != b && !a.SequenceEqual(b))
            {
                throw new Exception("difference between findFourCycle1 & 2");
            }
            if (a != c && !a.SequenceEqual(c))
            {
                throw new Exception("difference between findFourCycle1 & 3");
            }
            a = Faster.FindFourCycle1(TestGraphs.TestGraph15());
            b = Faster.FindFourCycle2(TestGraphs.TestGraph15());
            c = Faster.FindFourCycle3(TestGraphs.TestGraph15());
            // In this graph, the rithms find different cycles. I believe this to be ok, so have disabled the sequenceequal
            if (a != null && a.Count != 4)
            {
                throw new Exception("error in findFourCycle1");
            }
            if (b != null && b.Count != 4)
            {
                throw new Exception("error in findFourCycle2");
            }
            if (c != null && c.Count != 4)
            {
                throw new Exception("error in findFourCycle1¨3");
            }
            if ((a == b && a != c) || (b == c && b != a))
            {
                throw new Exception("difference between cycle rithms");
            }



            // Too big k test
            (var k1, var ret1) = Faster.FasterInner(TestGraphs.TestGraph8(), 8, 16, new HashSet <int>(), null, null, new HashSet <Edge <int> >());
            (var k2, var ret2) = Faster.Run(TestGraphs.TestGraph8());
            if ((8 - k1) != k2)
            {
                throw new Exception("Wrong result if k is started too big");
            }
        }
Ejemplo n.º 4
0
        public static void testAllGraphs()
        {
            (var k, var edgeSet) = Faster.Run(TestGraphs.TestGraph1());
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph1");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph2());
            if (k != 3)
            {
                throw new Exception("k error on graph2");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph2");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph3());
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph3");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph4());
            if (k != 1)
            {
                throw new Exception("k error on graph4");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph4");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph5());
            if (k != 2)
            {
                throw new Exception("k error on graph5");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph5");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph6());
            if (k != 2)
            {
                throw new Exception("k error on graph6");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph6");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph7());
            if (k != 0)
            {
                throw new Exception("k error on graph7");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph7");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph8());
            if (k != 1)
            {
                throw new Exception("k error on graph8");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph8");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph9());
            if (k != 0)
            {
                throw new Exception("k error on graph9");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph9");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph10());
            if (k != 1)
            {
                throw new Exception("k error on graph10");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph10");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph11());
            if (k != 1)
            {
                throw new Exception("k error on graph11");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph11");
            }

            (k, edgeSet) = Faster.Run(TestGraphs.TestGraph12());
            if (k != 2)
            {
                throw new Exception("k error on graph11");
            }
            if (edgeSet.Count != k)
            {
                throw new Exception("edge set error on graph11");
            }
        }