public Dictionary<Vector2i, List<GridEdge>> KruskalsMinimumSpanningForest(float[,] weights, IComparer<GridEdge> comparer = null)
{
if (comparer == null)
comparer = new GridEdgeComparer();
return Searches.KruskalsMinimumSpanningForest.Search(this, weights, comparer);
}
public void PrimsMinimumSpanningTree(GridSearch search, int x, int y, float[,] weights, IComparer<GridEdge> comparer = null)
{
if (comparer == null)
comparer = new GridEdgeComparer();
Searches.PrimsMinimumSpanningTree.Search(this, search, x, y, weights, comparer);
}
