public bool GetHamiltonianCycle(GraphSamples.Graph graph, List <GraphSamples.Vertex> result)
{
GraphSamples.Vertex startVertex = graph.Verticies[0];
HashSet <GraphSamples.Vertex> visited = new HashSet <GraphSamples.Vertex>();
return(HamiltonianUtil(startVertex, startVertex, result, visited, graph.Verticies.Count));
}
public void colorGraph()
{
GraphSamples.Graph graph = new GraphSamples.Graph(false);
graph.AddEdge(1, 2);
graph.AddEdge(2, 3);
graph.AddEdge(1, 4);
graph.AddEdge(4, 6);
graph.AddEdge(1, 7);
graph.AddEdge(1, 8);
graph.AddEdge(2, 9);
graph.AddEdge(1, 3);
graph.AddEdge(3, 4);
graph.AddEdge(2, 4);
graph.AddEdge(3, 7);
graph.Display();
Dictionary <String, bool> colorsUsed = new Dictionary <String, bool>();
colorsUsed["Green"] = false;
colorsUsed["Blue"] = false;
colorsUsed["Red"] = false;
colorsUsed["Yellow"] = false;
Dictionary <long, String> colorsAssigned = new Dictionary <long, String>();
ConcurrentDictionary <long, GraphSamples.Vertex> allVertex = graph.Verticies;
foreach (KeyValuePair <long, GraphSamples.Vertex> vertexPair in allVertex)
{
List <GraphSamples.Vertex> adjacentVertexes = vertexPair.Value.Adjacents;
foreach (GraphSamples.Vertex adjacentVertex in adjacentVertexes)
{
String curColor = colorsAssigned[adjacentVertex.Id];
if (curColor != null)
{
AssignColor(curColor, colorsUsed);
}
}
String color = GetUnusedColor(colorsUsed);
colorsAssigned[vertexPair.Key] = color;
ResetColor(colorsUsed);
}
Console.WriteLine(colorsAssigned);
}
public void HamiltonianCycleTest()
{
GraphSamples.Graph graph = new GraphSamples.Graph(false);
graph.AddEdge(1, 2);
graph.AddEdge(2, 3);
graph.AddEdge(3, 5);
graph.AddEdge(5, 2);
graph.AddEdge(2, 4);
graph.AddEdge(4, 1);
graph.AddEdge(4, 5);
List <GraphSamples.Vertex> result = new List <GraphSamples.Vertex>();
bool isHamiltonian = GetHamiltonianCycle(graph, result);
Console.WriteLine(isHamiltonian);
if (isHamiltonian)
{
Console.WriteLine(result);
}
}
public void WelshPowell()
{
GraphSamples.Graph graph = new GraphSamples.Graph(false);
graph.AddEdge(1, 2);
graph.AddEdge(2, 3);
graph.AddEdge(1, 4);
graph.AddEdge(4, 6);
graph.AddEdge(1, 7);
graph.AddEdge(1, 8);
graph.AddEdge(2, 9);
graph.AddEdge(1, 3);
graph.AddEdge(3, 4);
graph.AddEdge(2, 4);
graph.AddEdge(3, 7);
graph.AddEdge(2, 7);
graph.Display();
ComparatorVertex c = new ComparatorVertex();
SortedSet <GraphSamples.Vertex> sortedSet = new SortedSet <GraphSamples.Vertex>(); //TODO FIX it (c);
foreach (KeyValuePair <long, GraphSamples.Vertex> vertexPair in graph.Verticies)
{
sortedSet.Add(vertexPair.Value);
}
Dictionary <long, String> assignedColor = new Dictionary <long, String>();
Dictionary <long, String> finalAssignedColor = new Dictionary <long, String>();
Dictionary <String, bool> colorsUsed = new Dictionary <string, bool>();
colorsUsed["Green"] = false;
colorsUsed["Blue"] = false;
colorsUsed["Red"] = false;
colorsUsed["Yellow"] = false;
colorsUsed["Orange"] = false;
HashSet <GraphSamples.Vertex> RemoveSet = new HashSet <GraphSamples.Vertex>();
while (sortedSet.Count() != RemoveSet.Count())
{
String color = null;
foreach (GraphSamples.Vertex vertex in sortedSet)
{
if (RemoveSet.Contains(vertex))
{
continue;
}
bool allUncolored = IsAllAdjacentsUnColored(vertex.Adjacents, assignedColor);
if (allUncolored)
{
color = GetUnusedColor(colorsUsed);
assignedColor[vertex.Id] = color;
RemoveSet.Add(vertex);
finalAssignedColor[vertex.Id] = color;
}
}
colorsUsed.Remove(color);
assignedColor.Clear();
}
Console.WriteLine(finalAssignedColor);
}
