/// <summary>
/// Test the specified graph.
/// </summary>
/// <param name="graph">Graph to be tested.</param>
public static void Test(Graph graph)
{
var graph_2 = (Graph)graph.Clone();
var edges = graph.E
.Select(e => new WeightedEdge <Vertex> (e.U, e.V, e.W))
.ToList();
var quickGraph = new UndirectedGraph <Vertex, WeightedEdge <Vertex> > ();
quickGraph.AddVertexRange(graph.V);
quickGraph.AddEdgeRange(edges);
var customBoruvkaMst = BoruvkaMST.FindMST(graph);
var customKruskalMst = KruskalMST.FindMST(graph_2);
var quickGraphMst = quickGraph.MinimumSpanningTreeKruskal(e => e.Weight);
if (!(customBoruvkaMst.Length == customKruskalMst.Length &&
customKruskalMst.Length == quickGraphMst.Count()))
{
throw new Exception("Something wrong with the number of edges.");
}
var boruvkaWeight = customBoruvkaMst.Select(e => new BigInteger(e.W)).Aggregate(BigInteger.Add);
var kruskalWeight = customKruskalMst.Select(e => new BigInteger(e.W)).Aggregate(BigInteger.Add);
var quickGraphWeight = quickGraphMst.Select(e => new BigInteger(e.Weight)).Aggregate(BigInteger.Add);
if (!(boruvkaWeight == kruskalWeight &&
kruskalWeight == quickGraphWeight))
{
throw new Exception("Something wrong with MST weight.");
}
}
/// <summary>
/// Performs evaluation.
/// </summary>
/// <param name="runsNo">The number of samples.</param>
/// <param name="vNo">The number of vertexes in graph.</param>
public static EvalResult Eval(int runsNo, int vNo)
{
var boruvkaSparseTimes = new TimeSpan[runsNo];
var kruskalSparseTimes = new TimeSpan[runsNo];
var boruvkaDenseTimes = new TimeSpan[runsNo];
var kruskalDenseTimes = new TimeSpan[runsNo];
for (int i = 0; i < runsNo; ++i)
{
Graph sparseGraph_1 = new Graph();
sparseGraph_1.GenerateSparse(vNo);
Graph sparseGraph_2 = (Graph)sparseGraph_1.Clone();
GC.Collect();
GC.WaitForPendingFinalizers();
Stopwatch boruvkaSw = Stopwatch.StartNew();
BoruvkaMST.FindMST(sparseGraph_1);
boruvkaSw.Stop();
GC.Collect();
GC.WaitForPendingFinalizers();
Stopwatch kruskalSw = Stopwatch.StartNew();
KruskalMST.FindMST(sparseGraph_2);
kruskalSw.Stop();
boruvkaSparseTimes[i] = boruvkaSw.Elapsed;
kruskalSparseTimes[i] = kruskalSw.Elapsed;
}
for (int i = 0; i < runsNo; ++i)
{
Graph denseGraph_1 = new Graph();
denseGraph_1.GenerateDense(vNo);
Graph denseGraph_2 = (Graph)denseGraph_1.Clone();
GC.Collect();
GC.WaitForPendingFinalizers();
Stopwatch boruvkaSw = Stopwatch.StartNew();
BoruvkaMST.FindMST(denseGraph_1);
boruvkaSw.Stop();
GC.Collect();
GC.WaitForPendingFinalizers();
Stopwatch kruskalSw = Stopwatch.StartNew();
KruskalMST.FindMST(denseGraph_2);
kruskalSw.Stop();
boruvkaDenseTimes[i] = boruvkaSw.Elapsed;
kruskalDenseTimes[i] = kruskalSw.Elapsed;
}
var boruvkaSparseAverage = new TimeSpan((long)boruvkaSparseTimes.Select
(span => span.Ticks).Average());
var kruskalSparseAverage = new TimeSpan((long)kruskalSparseTimes.Select
(span => span.Ticks).Average());
var boruvkaDenseAverage = new TimeSpan((long)boruvkaDenseTimes.Select
(span => span.Ticks).Average());
var kruskalDenseAverage = new TimeSpan((long)kruskalDenseTimes.Select
(span => span.Ticks).Average());
return(new EvalResult(runsNo, vNo, boruvkaSparseAverage, kruskalSparseAverage,
boruvkaDenseAverage, kruskalDenseAverage));
}