本文整理汇总了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);
}示例2: RemoveEdgeIf04
public void RemoveEdgeIf04()
{
BidirectionalGraph bidirectionalGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
bidirectionalGraph = BidirectionalGraphFactory.CreateCyclicGraph(s0, false, 0);
this.RemoveEdgeIf(bidirectionalGraph);
}示例3: RemoveEdgeIf05
public void RemoveEdgeIf05()
{
BidirectionalGraph bidirectionalGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
bidirectionalGraph = BidirectionalGraphFactory.CreateCyclicGraph(s0, false, 16);
((GenericMutableEdgeListGraphTest)this).RemoveEdgeIf(bidirectionalGraph);
}示例4: AddEdgeTargetNotFound04
public void AddEdgeTargetNotFound04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 5);
((GenericMutableGraphTestNEW)this).AddEdgeTargetNotFound(adjacencyGraph);
}示例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;
}示例6: GraphWithSelfEdgesPUT06
public void GraphWithSelfEdgesPUT06()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 0);
this.GraphWithSelfEdgesPUT(adjacencyGraph, 2);
}示例7: AddEdgeSourceNotFound05
public void AddEdgeSourceNotFound05()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, true, 6);
((GenericMutableGraphTestNEW)this).AddEdgeSourceNotFound(adjacencyGraph);
}示例8: AddRemoveVertexNotFound05
public void AddRemoveVertexNotFound05()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
this.AddRemoveVertexNotFound(adjacencyGraph);
}示例9: AddRemoveVertexNotFound04
public void AddRemoveVertexNotFound04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 4);
((GenericMutableGraphTestNEW)this).AddRemoveVertexNotFound(adjacencyGraph);
}示例10: RemoveEdgeNotFound05
public void RemoveEdgeNotFound05()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 49);
this.RemoveEdgeNotFound(adjacencyGraph);
}示例11: AddRemoveVertexNotFound04
public void AddRemoveVertexNotFound04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 16);
this.AddRemoveVertexNotFound(adjacencyGraph);
}示例12: AddEdgeTargetNotFound03
public void AddEdgeTargetNotFound03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 4);
this.AddEdgeTargetNotFound(adjacencyGraph);
}示例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);
}示例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;
}示例15: AddEdgeSourceNotFound03
public void AddEdgeSourceNotFound03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 26);
this.AddEdgeSourceNotFound(adjacencyGraph);
}