Class AcyclicShortestPaths<TWeight>

Namespace

AlgorithmsSW.EdgeWeightedDigraph

Assembly

AlgorithmsSW.dll

Algorithm that finds the shortest paths in an edge weighted digraph with no negative cycles.

public class AcyclicShortestPaths<TWeight> : IShortestPath<TWeight> where TWeight : INumber<TWeight>, IMinMaxValue<TWeight>

Type Parameters

TWeight

The type of the edge weights.

Inheritance

object

AcyclicShortestPaths<TWeight>

Implements

IShortestPath<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

AcyclicShortestPaths(IReadOnlyEdgeWeightedDigraph<TWeight>, int)

Initializes a new instance of the AcyclicShortestPaths<TWeight> class.

public AcyclicShortestPaths(IReadOnlyEdgeWeightedDigraph<TWeight> graph, int source)

Parameters

graph IReadOnlyEdgeWeightedDigraph<TWeight>

The graph to find the shortest paths in.

source int

The source vertex to find the shortest paths from.

Methods

GetDistanceTo(int)

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

public TWeight GetDistanceTo(int vertex)

Parameters

vertex int

The vertex to find the distance to.

Returns

TWeight

The distance from the source vertex to the given vertex.

GetEdgesOfPathTo(int)

Gets the path from the source vertex to the given vertex.

public IEnumerable<DirectedEdge<TWeight>> GetEdgesOfPathTo(int target)

Parameters

target int

The vertex to find the path to.

Returns

IEnumerable<DirectedEdge<TWeight>>

An enumerable of edges representing the path from the source vertex to the given vertex.

Exceptions

InvalidOperationException

+there is no path from the source vertex to the given vertex.

HasPathTo(int)

Whether there is a path from the source vertex to the given vertex.

public bool HasPathTo(int vertex)

Parameters

vertex int

The vertex to check if there is a path to.

Returns

bool

true if there is a path from the source vertex to the given vertex; otherwise, false.