Class DijkstraSets

A modified version of Dijkstra's algorithm that finds the shortest path from any of a set of sources to a set of sinks.

[ExerciseReference(4, 4, 25)]
public class DijkstraSets

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 implementation can be faster than vanilla Dijkstra since we can stop early once we found a sink.

Initializes a new instance of the DijkstraSets class.

public DijkstraSets(IEdgeWeightedDigraph<double> graph, IEnumerable<int> sources, IEnumerable<int> sinks)

graph IEdgeWeightedDigraph<double>: The graph to find the shortest paths in.
sources IEnumerable<int>: The source vertexes to find the shortest paths from.
sinks IEnumerable<int>: The sink vertexes to find the shortest paths to.

public double Distance { get; }

public DirectedPath<double> Path { get; }

public bool PathExists { get; }