C# (CSharp) IVertexAndEdgeListGraph.Roots示例

示例#1

文件： AlgorithmExtensionsTest.cs 项目： barsgroup/QuickGraph

        public void Roots <T>(IVertexAndEdgeListGraph <T, Edge <T> > g)
        {
            var roots = new HashSet <T>(g.Roots());

            foreach (var edge in g.Edges)
            {
                Assert.IsFalse(roots.Contains(edge.Target));
            }
        }

示例#2

文件： AlgorithmExtensionsTest.cs 项目： polytronicgr/Sandwych.QuickGraph

        private void Roots <T>(IVertexAndEdgeListGraph <T, Edge <T> > g)
        {
            var roots = new HashSet <T>(g.Roots());

            foreach (var edge in g.Edges)
            {
                Assert.Contains(edge.Target, roots);
            }
        }

示例#3

文件： AlgorithmExtensionsTests.cs 项目： OwenMcDonnell/QuikGraph

        private static void Roots <T>([NotNull] IVertexAndEdgeListGraph <T, Edge <T> > graph)
        {
            var roots = new HashSet <T>(graph.Roots());

            foreach (Edge <T> edge in graph.Edges)
            {
                Assert.IsFalse(roots.Contains(edge.Target));
            }
        }