Class DijkstraMultiSource

Namespace

AlgorithmsSW.EdgeWeightedDigraph

Assembly

AlgorithmsSW.dll

A modified version of Dijkstra's algorithm that finds the shortest path from any source to any vertex.

[ExerciseReference(4, 4, 24)]
public class DijkstraMultiSource

Inheritance

object

DijkstraMultiSource

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

DijkstraMultiSource(IEdgeWeightedDigraph<double>, IEnumerable<int>)

Initializes a new instance of the DijkstraMultiSource class.

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

Parameters

graph IEdgeWeightedDigraph<double>

The graph to find the shortest paths in.

sources IEnumerable<int>

The source vertexes to find the shortest paths from.

Exceptions

ArgumentException

graph contains negative weights.

Methods

Distance(int)

Gets the distance from the source to the sink.

public double Distance(int sourceVertex)

Parameters

sourceVertex int

Returns

double

Exceptions

InvalidOperationException

PathExists(int) is false.

GetPath(int)

Gets the path from the source to the sink.

public DirectedPath<double> GetPath(int vertex)

Parameters

vertex int

Returns

DirectedPath<double>

Exceptions

InvalidOperationException

PathExists(int) is false.

PathExists(int)

public bool PathExists(int vertex)

Parameters

vertex int

Returns

bool