Class Kruskals<T, TW>
A Kruskal's alogorithm implementation using merge sort and disjoint set.
Inherited Members
Namespace: Advanced.Algorithms.Graph
Assembly: Advanced.Algorithms.dll
Syntax
public class Kruskals<T, TW>
where TW : IComparable
Type Parameters
Name | Description |
---|---|
T | |
TW |
Methods
FindMinimumSpanningTree(WeightedGraph<T, TW>)
Find Minimum Spanning Tree of given weighted graph.
Declaration
public List<MSTEdge<T, TW>> FindMinimumSpanningTree(WeightedGraph<T, TW> graph)
Parameters
Type | Name | Description |
---|---|---|
WeightedGraph<T, TW> | graph |
Returns
Type | Description |
---|---|
List<MSTEdge<T, TW>> | List of MST edges |