Class KruskalMstDWayHeap<TWeight>

An implementation of Kruskal's algorithm for finding the minimum spanning tree of a weighted graph, using a N-heap.

public class KruskalMstDWayHeap<TWeight> : IMst<TWeight> where TWeight : INumber<TWeight>

Inherited Members: object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Extension Methods: Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>)

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Interpolate<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Substitute<T, TBuffer>(TBuffer, (T input, T[] output)[])

Comparable.ToComparable<T>(T, IComparer<T>)

Formatter.AsText<T>(T?)

Formatter.Describe<TLabel, TDescription>(TLabel, TDescription, string)

Formatter.Log<T>(T)

Formatter.Pretty<T>(T, params int[])

Constructors

Initializes a new instance of the KruskalMstDWayHeap<TWeight> class.

public KruskalMstDWayHeap(IEdgeWeightedGraph<TWeight> graph, int heapDegree)

graph IEdgeWeightedGraph<TWeight>: The graph to find the minimum spanning tree of.
heapDegree int: The degree of the heap to use.

Gets the edges that is part of the minimum spanning tree.

public IEnumerable<Edge<TWeight>> Edges { get; }