Interface IMst<TWeight>

Namespace

AlgorithmsSW.EdgeWeightedGraph

Assembly

AlgorithmsSW.dll

An algorithm for calculating the minimum spanning tree of a edge weighted graph.

public interface IMst<TWeight> where TWeight : INumber<TWeight>

Type Parameters

TWeight

The type of the edge weights.

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[])

Properties

Edges

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

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

Property Value

IEnumerable<Edge<TWeight>>

Methods

GetTotalWeight()

Gets the total weight of the minimum spanning tree.

TWeight GetTotalWeight()

Returns

TWeight

The total weight of the minimum spanning tree.