public void Run(string dotSource)
{
edges.Clear();
var graph = UndirectedGraphFactory.GetUnderectedGraphFromDot(dotSource);
var prim = new QuickGraph.Algorithms.MinimumSpanningTree.PrimMinimumSpanningTreeAlgorithm <GraphXVertex, GraphXTaggedEdge <GraphXVertex, int> >(graph, x => x.Tag);
prim.TreeEdge += Prim_TreeEdge;
prim.ExamineEdge += Prim_ExamineEdge;
prim.Compute();
HelperForKruskalAndPrimVisualisation.Run(dotSource, edges);
HelperForKruskalAndPrimVisualisation.CanBack += HelperForKruskalAndPrimVisualisation_CanBack;
HelperForKruskalAndPrimVisualisation.CanFuther += HelperForKruskalAndPrimVisualisation_CanFuther;
}
public void PreviousStep()
{
HelperForKruskalAndPrimVisualisation.PreviousStep();
}
public void NextStep()
{
HelperForKruskalAndPrimVisualisation.NextStep();
}
