public void AddEdgeTargetNotFound04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, true, 9);
this.AddEdgeTargetNotFound(adjacencyGraph);
}
public void RemoveEdgeIf04()
{
BidirectionalGraph bidirectionalGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
bidirectionalGraph = BidirectionalGraphFactory.CreateCyclicGraph(s0, false, 0);
this.RemoveEdgeIf(bidirectionalGraph);
}
public void RemoveEdgeIf05()
{
BidirectionalGraph bidirectionalGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
bidirectionalGraph = BidirectionalGraphFactory.CreateCyclicGraph(s0, false, 16);
((GenericMutableEdgeListGraphTest)this).RemoveEdgeIf(bidirectionalGraph);
}
public void AddEdgeTargetNotFound04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 5);
((GenericMutableGraphTestNEW)this).AddEdgeTargetNotFound(adjacencyGraph);
}
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;
}
public void GraphWithSelfEdgesPUT06()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 0);
this.GraphWithSelfEdgesPUT(adjacencyGraph, 2);
}
public void AddEdgeSourceNotFound05()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, true, 6);
((GenericMutableGraphTestNEW)this).AddEdgeSourceNotFound(adjacencyGraph);
}
public void AddRemoveVertexNotFound05()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
this.AddRemoveVertexNotFound(adjacencyGraph);
}
public void AddRemoveVertexNotFound04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 4);
((GenericMutableGraphTestNEW)this).AddRemoveVertexNotFound(adjacencyGraph);
}
public void RemoveEdgeNotFound05()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 49);
this.RemoveEdgeNotFound(adjacencyGraph);
}
public void AddRemoveVertexNotFound04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 16);
this.AddRemoveVertexNotFound(adjacencyGraph);
}
public void AddEdgeTargetNotFound03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 4);
this.AddEdgeTargetNotFound(adjacencyGraph);
}
public void SortCyclicPUT_NEW06()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 16);
this.SortCyclicPUT_NEW(adjacencyGraph, (IVertex[])null, false);
}
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;
}
public void AddEdgeSourceNotFound03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 26);
this.AddEdgeSourceNotFound(adjacencyGraph);
}
public void RemoveEdgeNotFound03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 16);
((GenericMutableGraphTestNEW)this).RemoveEdgeNotFound(adjacencyGraph);
}
public void GraphWithSelfEdgesPUT06()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
IPexChoiceRecorder choices = PexChoose.NewTest();
this.GraphWithSelfEdgesPUT(adjacencyGraph, 2, false);
}
public void RemoveOutEdgeIf03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 16);
this.RemoveOutEdgeIf(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void TestOutDegree03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
((GenericAdjacencyGraphTest)this).TestOutDegree(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void AddRemoveVertex02()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 16);
((GenericMutableGraphTestNEW)this).AddRemoveVertex(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void IterationPUT02()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, false, 16);
((GenericVertexListGraphTest)this).IterationPUT(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void ClearVertexTargetSource04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
this.ClearVertexTargetSource(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void RemoveOutEdgeIf02()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
((GenericMutableAdjacencyGraphTest)this).RemoveOutEdgeIf(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void IterationPUT03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
this.IterationPUT(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void ClearVertexSourceTarget04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph(s0, false, 0);
((GenericMutableGraphTestNEW)this).ClearVertexSourceTarget(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void AddEdge03()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 0);
this.AddEdge(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void RemoveOutEdgeIf04()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateCyclicGraph
(s0, PexSafeHelpers.ByteToBoolean((byte)2), 16);
this.RemoveOutEdgeIf(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void RemoveOutEdgeIf01()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph
(s0, PexSafeHelpers.ByteToBoolean((byte)4), 49);
((GenericMutableAdjacencyGraphTest)this).RemoveOutEdgeIf(adjacencyGraph);
PexAssert.IsNotNull((object)adjacencyGraph);
PexAssert.AreEqual<bool>(true, adjacencyGraph.IsDirected);
PexAssert.IsNotNull(adjacencyGraph.Provider);
PexAssert.IsNotNull(adjacencyGraph.Edges);
}
public void SortCyclicPUT_NEW20()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 0);
IVertex[] iVertexs = new IVertex[1];
this.SortCyclicPUT_NEW(adjacencyGraph, iVertexs, false);
}
public void GraphWithSelfEdgesPUT07()
{
AdjacencyGraph adjacencyGraph;
VertexAndEdgeProvider s0 = new VertexAndEdgeProvider();
adjacencyGraph = AdjacencyGraphFactory.CreateAcyclicGraph(s0, true, 0);
IPexChoiceRecorder choices = PexChoose.NewTest();
((IPexChoiceSessionBuilder)(choices.NextSegment(1)
.OnCall(0,
"BreadthFirstAlgorithmSearchTestNEW.GraphWithSelfEdgesPUT(AdjacencyGraph, Int32)")
))
.At(0, "to add a self ede", (object)true);
this.GraphWithSelfEdgesPUT(adjacencyGraph, 2);
}
