public SearchResult <T> MinimumSpanningTree(int visitCount) { var mst = Kruskal <T> .MinimumSpanningTree(this); SearchResult <T> minResult = null; foreach (var v in mst.Vertices) { SearchResult <T> result = DFS(mst, v, visitCount - 1); if (minResult == null || result.Cost < minResult.Cost) { minResult = result; } } //Console.WriteLine(minResult.Cost); return(minResult); }
public Graph <T> MinimumSpanningTree() { return(Kruskal <T> .MinimumSpanningTree(this)); }