Class BoruvkasAlgorithmImproved<TWeight>

An implementation of Boruvka's algorithm to find the MST of a graph.

public class BoruvkasAlgorithmImproved<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[])

Remarks

This algorithm is not really better than BoruvkasAlgorithm<TWeight>.

public BoruvkasAlgorithmImproved(IEdgeWeightedGraph<TWeight> graph)

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

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