C# Providers.VertexAndEdgeProvider類代碼示例

本文整理匯總了C#中QuickGraph.Providers.VertexAndEdgeProvider類的典型用法代碼示例。如果您正苦於以下問題：C# VertexAndEdgeProvider類的具體用法？C# VertexAndEdgeProvider怎麽用？C# VertexAndEdgeProvider使用的例子？那麽, 這裏精選的類代碼示例或許可以為您提供幫助。

VertexAndEdgeProvider類屬於QuickGraph.Providers命名空間，在下文中一共展示了VertexAndEdgeProvider類的15個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的C#代碼示例。

示例1: AddEdgeTargetNotFound04

 public void AddEdgeTargetNotFound04()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, true, 9);
     this.AddEdgeTargetNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:GenericMutableGraphTestNEWAddEdgeTargetN.g.cs

示例2: RemoveEdgeIf04

 public void RemoveEdgeIf04()
 {
     BidirectionalGraph bidirectionalGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     bidirectionalGraph = BidirectionalGraphFactory.CreateCyclicGraph(s0, false, 0);
     this.RemoveEdgeIf(bidirectionalGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:GenericMutableEdgeListGraphTestRemoveEdg.g.cs

示例3: RemoveEdgeIf05

 public void RemoveEdgeIf05()
 {
     BidirectionalGraph bidirectionalGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     bidirectionalGraph = BidirectionalGraphFactory.CreateCyclicGraph(s0, false, 16);
     ((GenericMutableEdgeListGraphTest)this).RemoveEdgeIf(bidirectionalGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:BidirectionaleMutableEdgeListGraphTestRe.g.cs

示例4: AddEdgeTargetNotFound04

 public void AddEdgeTargetNotFound04()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 5);
     ((GenericMutableGraphTestNEW)this).AddEdgeTargetNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:BidirectionaleMutableGraphTestAddEdgeTar.g.cs

示例5: CreateAcyclicGraph

        public static AdjacencyGraph CreateAcyclicGraph(
            VertexAndEdgeProvider provider_iVertexAndEdgeProvider,
            bool allowParallelEdges_b,
            int numberOfVertices
            )
        {
            PexAssume.IsTrue(numberOfVertices < 50);

            AdjacencyGraph adjacencyGraph
               = new AdjacencyGraph(provider_iVertexAndEdgeProvider, allowParallelEdges_b);

            IVertex u = adjacencyGraph.AddVertex();
            IVertex v = adjacencyGraph.AddVertex();
            IVertex w = adjacencyGraph.AddVertex();
            adjacencyGraph.AddEdge(u, v);
            adjacencyGraph.AddEdge(v, w);
            adjacencyGraph.AddEdge(u, w);

            //Adding remaining number of vertices
            for (int count = 3; count < numberOfVertices; count++)
            {
                adjacencyGraph.AddVertex();
            }

            return adjacencyGraph;
        }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:26，代碼來源:AdjacencyGraphFactory.cs

示例6: GraphWithSelfEdgesPUT06

 public void GraphWithSelfEdgesPUT06()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 0);
     this.GraphWithSelfEdgesPUT(adjacencyGraph, 2);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:BreadthFirstAlgorithmSearchTestNEWGraphW.g.cs

示例7: AddEdgeSourceNotFound05

 public void AddEdgeSourceNotFound05()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, true, 6);
     ((GenericMutableGraphTestNEW)this).AddEdgeSourceNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:BidirectionaleMutableGraphTestAddEdgeSou.g.cs

示例8: AddRemoveVertexNotFound05

 public void AddRemoveVertexNotFound05()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
     this.AddRemoveVertexNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:GenericMutableGraphTestNEWAddRemoveVerte01.g.cs

示例9: AddRemoveVertexNotFound04

 public void AddRemoveVertexNotFound04()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 4);
     ((GenericMutableGraphTestNEW)this).AddRemoveVertexNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:BidirectionaleMutableGraphTestAddRemoveV01.g.cs

示例10: RemoveEdgeNotFound05

 public void RemoveEdgeNotFound05()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 49);
     this.RemoveEdgeNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:GenericMutableGraphTestNEWRemoveEdgeNotF.g.cs

示例11: AddRemoveVertexNotFound04

 public void AddRemoveVertexNotFound04()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 16);
     this.AddRemoveVertexNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:GenericMutableGraphTestNEWAddRemoveVerte01.g.cs

示例12: AddEdgeTargetNotFound03

 public void AddEdgeTargetNotFound03()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 4);
     this.AddEdgeTargetNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:GenericMutableGraphTestNEWAddEdgeTargetN.g.cs

示例13: SortCyclicPUT_NEW06

 public void SortCyclicPUT_NEW06()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 16);
     this.SortCyclicPUT_NEW(adjacencyGraph, (IVertex[])null, false);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:TopologicalSortAlgorithmTestNEWSortCycli.g.cs

示例14: CreateCyclicGraph

        public static BidirectionalGraph CreateCyclicGraph(
            VertexAndEdgeProvider provider_iVertexAndEdgeProvider,
            bool allowParallelEdges_b,
            int numberOfVertices)
        {
            PexAssume.IsTrue(numberOfVertices < 50);

            BidirectionalGraph biGraph
               = new BidirectionalGraph(provider_iVertexAndEdgeProvider, allowParallelEdges_b);

            IVertex u = biGraph.AddVertex();
            IVertex v = biGraph.AddVertex();
            IVertex w = biGraph.AddVertex();
            biGraph.AddEdge(u, v);
            biGraph.AddEdge(v, w);
            biGraph.AddEdge(w, u);

            //Adding remaining number of vertices
            for (int count = 3; count < numberOfVertices; count++)
            {
                biGraph.AddVertex();
            }

            return biGraph;
        }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:25，代碼來源:BidirectionalGraphFactory.cs

示例15: AddEdgeSourceNotFound03

 public void AddEdgeSourceNotFound03()
 {
     AdjacencyGraph adjacencyGraph;
     VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
     adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 26);
     this.AddEdgeSourceNotFound(adjacencyGraph);
 }

開發者ID:taoxiease，項目名稱:asegrp，代碼行數:7，代碼來源:GenericMutableGraphTestNEWAddEdgeSourceN.g.cs

注：本文中的QuickGraph.Providers.VertexAndEdgeProvider類示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台，相關代碼片段篩選自各路編程大神貢獻的開源項目，源碼版權歸原作者所有，傳播和使用請參考對應項目的License；未經允許，請勿轉載。