private void TestGraph(Graph graph, int?expectedChromaticNumber, int?expectedAcyclicNumber)
{
// classical tests
var solution = new ExactClassicAlgorithm().ColourGraph(graph);
DetailedClassicVerification(graph, solution, expectedChromaticNumber);
// acyclicity tests
//var acyclicSolution = new ExactAcyclicAlgorithmDepthLimit().ColourGraph(graph);
//DetailedAcyclicVerification(graph, acyclicSolution, null, expectedAcyclicNumber);
}
static void Main(string[] args)
{
// There are 2 important parts to change, both are listed below
// IMPORTANT1 the algorithm
var algorithmDescription = string.Empty;
Dictionary <int, int> generateNewAlgorithmAndSolve(EventHandler <PerformanceReport> performanceReport, Graph graph)
{
var algorithm = new ExactClassicAlgorithm();
algorithmDescription = "exact";
algorithm.NewBestSolutionFound += performanceReport;
return(algorithm.ColourGraph(graph));
}
var nRange = Enumerable.Range(60, 190);
var rangeCount = 10;
var densityRange = Enumerable.Range(0, rangeCount).Select(number => .5d - .5d * Math.Cos(Math.PI * ((2 * number + 1) / (2d * rangeCount))));
Console.WriteLine("Performance tests:");
var random = new Random(12);
foreach (var n in nRange)
{
Console.WriteLine();
Console.WriteLine();
Console.WriteLine();
Console.WriteLine();
foreach (var density in densityRange)
{
Console.WriteLine();
Console.WriteLine();
Console.Write($"New random graph benchmark. Vertices ");
Console.ForegroundColor = ConsoleColor.DarkGreen;
Console.Write($"{n}");
Console.ResetColor();
Console.Write($", edge density ");
Console.ForegroundColor = ConsoleColor.DarkGreen;
Console.WriteLine($"{density}");
Console.ResetColor();
Console.WriteLine();
// IMPORTANT2 the problem
var graph = GraphFactory.GenerateRandom2(n, density, random.Next());
PerformTestGetCSVResults(graph);
}
}
// var graph2 = Reader.ParseGraph("games120");
// PerformTestGetCSVResults(graph2);
string PerformTestGetCSVResults(Graph graph)
{
var stopwatch = new Stopwatch();
var reportedTimes = new List <TimeSpan>();
var reportedColourings = new List <int>();
string GetTextToExport()
{
var toExport = new StringBuilder();
for (int i = 0; i < reportedTimes.Count; i++)
{
toExport.AppendLine($"{reportedTimes[i].TotalMilliseconds},{reportedColourings[i]}");
}
return(toExport.ToString());
}
void PerformanceReport(object sender, PerformanceReport report)
{
Console.Write($"Found new solution: ");
Console.ForegroundColor = ConsoleColor.Green;
Console.Write($"{report.minimalNumberOfColoursUsed}");
Console.ResetColor();
Console.Write($" after ");
Console.ForegroundColor = ConsoleColor.Green;
Console.Write($"{report.elapsedProcessorTime}");
Console.ResetColor();
Console.WriteLine($" ms");
reportedTimes.Add(report.elapsedProcessorTime);
reportedColourings.Add(report.minimalNumberOfColoursUsed);
var text = GetTextToExport();
File.WriteAllText($"{algorithmDescription}-{graph.ToString()}.tmp.csv", text);
}
//var solution = new Dictionary<int, int>();
//Console.WriteLine($"Size {n}, density {density:f2}");
stopwatch.Restart();
var solution = generateNewAlgorithmAndSolve(PerformanceReport, graph);
stopwatch.Stop();
//for (int i = 0; i < solution.Max(kvp => kvp.Value); i++)
//{
// var count = solution.Count(kvp => kvp.Value == i);
// Console.WriteLine($"Colour {i} count: {count}");
//}
// mark the end of computation time
PerformanceReport(null, new PerformanceReport()
{
elapsedProcessorTime = stopwatch.Elapsed,
minimalNumberOfColoursUsed = reportedColourings.LastOrDefault()
});
return(GetTextToExport());
}
}