C# (CSharp) Algorithms.Graph DirectedCycle Examples

Example #1

        public void DirectedCycle_hasCycle_true()
        {
            var g   = initDG();
            var dc  = new DirectedCycle(g);
            var res = dc.hasCycle();

            Assert.True(res);
        }

Example #2

File: Topological.cs Project: Shiheuan/UnityAlgorithms

        public Topological(Digraph G)
        {
            DirectedCycle cycleFinder = new DirectedCycle(G);

            if (!cycleFinder.hasCycle())
            {
                DepthFirstOrder dfs = new DepthFirstOrder(G);
                order = dfs.getReversePost();
            }
        }