Class DijkstraAllPairs<TWeight>

A class for finding the shortest path from a source vertex to all other vertices in a directed edge weighted graph.

public class DijkstraAllPairs<TWeight> where TWeight : INumber<TWeight>, IMinMaxValue<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 DijkstraAllPairs<TWeight> class.

public DijkstraAllPairs(IReadOnlyEdgeWeightedDigraph<TWeight> graph)

graph IReadOnlyEdgeWeightedDigraph<TWeight>: The graph to find the shortest paths in.

Gets the distance from the source vertex to the target vertex.

public TWeight GetDistance(int sourceVertex, int targetVertex)

Gets the shortest path from the source vertex to the target vertex.

public IEnumerable<DirectedEdge<TWeight>> GetPath(int sourceVertex, int targetVertex)

IEnumerable<DirectedEdge<TWeight>>: An enumerable of edges representing the shortest path.