private void Invalid(IGraphInterface graph)
{
// Variable
List <IVertexInterface> vertexList = graph.AllVertices();
List <IVertexInterface> vertexNot2DegreeList = new List <IVertexInterface>();
vertexNot2DegreeList = vertexList.Where(v => graph.CountNeighbours(v) != 2).ToList();
IEdgeInterface edge = new Edge(vertexList.First(), graph.Neighbours(vertexList.First()).First());
// Vertex add
stringBuilder.AppendLine("Vertex add");
stringBuilder.AppendLine("Vertex exists");
try { graph.VertexAdd(vertexList.First()); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
// Vertex delete
stringBuilder.AppendLine("Vertex delete");
stringBuilder.AppendLine("Vertex doesn't exist");
try { graph.VertexDelete(new Vertex()); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
// Vertex contract
stringBuilder.AppendLine("Vertex contract");
stringBuilder.AppendLine("Vertex doesn't exist");
try { graph.VertexContraction(new Vertex()); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
// Vertex suppression
stringBuilder.AppendLine("Vertex suppression");
stringBuilder.AppendLine("Vertex doesn't exist");
try { graph.VertexSuppression(new Vertex()); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
stringBuilder.AppendLine("Invalid vertex degree");
try { graph.VertexSuppression(vertexNot2DegreeList.First()); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
// Vertex expansion
stringBuilder.AppendLine("Vertex expansion");
stringBuilder.AppendLine("Vertex doesn't exist");
try { graph.VertexExpansion(new Vertex()); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
// Edge add
stringBuilder.AppendLine("Edge add");
stringBuilder.AppendLine("Edge exists");
try { graph.EdgeAdd(edge); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
// Edge delete
stringBuilder.AppendLine("Edge delete");
stringBuilder.AppendLine("Edge doesn't exist");
try { graph.EdgeDelete(new Edge(new Vertex(), new Vertex())); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
// Edge contract
stringBuilder.AppendLine("Edge contract");
stringBuilder.AppendLine("Edge doesn't exist");
try { graph.EdgeContraction(new Edge(new Vertex(), new Vertex())); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
// Edge subdivision
stringBuilder.AppendLine("Edge subdivision");
stringBuilder.AppendLine("Edge doesn't exist");
try { graph.EdgeSubdivision(new Edge(new Vertex(), new Vertex())); }
catch (MyException.GraphException.GraphException e) { stringBuilder.AppendLine(e.Message); }
}
public void VertexExpansion(IVertexInterface vertex)
{
// Component
if (componentsList != null)
{
// Need change => copies of component
if (countComponents > 1)
{
// Get component which contains the vertex
IVertexInterface myVertexComponent = null;
IGraphInterface myComponentGraph = null;
foreach (IGraphInterface componentGraph in componentsList)
{
if (componentGraph.ExistsUserName(vertex.GetUserName()))
{
myComponentGraph = componentGraph;
myVertexComponent = myComponentGraph.GetVertexByUserName(vertex.GetUserName());
break;
}
}
myComponentGraph.VertexExpansion(myVertexComponent);
}
//componentsList = componentsList;
//countComponents = countComponents;
//isConnected = isConnected;
}
// Properties
isCyclic = null;
isEulerian = EulerianGraphEnum.undefined;
// IntegralInvariants
circuitRank = null;
girth = null;
cayleysFormula = null;
// SequencesAndPolynomialsOthers
if (isConnected != null && !(bool)isConnected)
{
spanningTreeBFS = spanningTreeBFS = new List <IEdgeInterface>();
}
else
{
spanningTreeBFS = null;
}
matching = null;
cutVertices = null;
bridges = null;
// DegreeSequence
degreeSequence = null;
maximumVertexDegree = null;
minimumVertexDegree = null;
averageVertexDegree = null;
medianVertexDegree = null;
isDegreeSequenceSorted = false;
isRegular = null;
// Chordal
if (isChordal.HasValue && (bool)isChordal)
{
isChordal = null;
perfectEliminationOrderingList = null;
righNeighborhoodDictionary = null;
}
// GraphClass
graphClass = GraphClass.GraphClass.GraphClassEnum.undefined;
}
private void Valid(IGraphInterface graph)
{
// Variable
List <IVertexInterface> vertexList = graph.AllVertices();
graph.VertexContraction(vertexList.First());
vertexList = graph.AllVertices();
graph.VertexSuppression(vertexList.First());
vertexList = graph.AllVertices();
graph.VertexExpansion(vertexList.First());
vertexList = graph.AllVertices();
graph.VertexSuppression(vertexList.Last());
vertexList = graph.AllVertices();
graph.VertexDelete(vertexList.First());
vertexList = graph.AllVertices();
graph.VertexSuppression(vertexList.Last());
vertexList = graph.AllVertices();
IVertexInterface v1 = new Vertex("V1");
graph.VertexAdd(v1);
vertexList = graph.AllVertices();
graph.EdgeAdd(new Edge(vertexList.First(), v1));
vertexList = graph.AllVertices();
graph.VertexContraction(v1);
vertexList = graph.AllVertices();
graph.EdgeSubdivision(new Edge(vertexList.First(), vertexList.Skip(1).First()));
vertexList = graph.AllVertices();
graph.EdgeAdd(new Edge(vertexList.First(), vertexList.Skip(1).First()));
vertexList = graph.AllVertices();
graph.EdgeContraction(new Edge(vertexList.First(), vertexList.Skip(1).First()));
vertexList = graph.AllVertices();
graph.EdgeDelete(new Edge(vertexList.First(), vertexList.Skip(1).First()));
vertexList = graph.AllVertices();
graph.VertexDelete(vertexList.Skip(1).First());
vertexList = graph.AllVertices();
graph.VertexSuppression(vertexList.First());
vertexList = graph.AllVertices();
graph.VertexDelete(vertexList.First());
vertexList = graph.AllVertices();
graph.VertexExpansion(vertexList.First());
vertexList = graph.AllVertices();
graph.EdgeContraction(new Edge(vertexList.First(), vertexList.Skip(1).First()));
vertexList = graph.AllVertices();
IVertexInterface v2 = new Vertex("V2");
graph.VertexAdd(v2);
vertexList = graph.AllVertices();
graph.VertexDelete(vertexList.Skip(1).First());
graph.VertexAdd(new Vertex("V3"));
}