Class YensAlgorithm<TWeight>

An implementation of Yen's algorithm of finding the k shortest paths between vertices in a directed edge weighted graph.

[ExerciseReference(4, 4, 7)]
public class YensAlgorithm<TWeight> : IKShortestPaths<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 YensAlgorithm<TWeight> class.

public YensAlgorithm(IEdgeWeightedDigraph<TWeight> digraph, int source, int target, int shortestPathCount)

digraph IEdgeWeightedDigraph<TWeight>: The directed graph in which to find the paths.
source int: The source vertex from where paths originate.
target int: The target vertex to which paths should lead.
shortestPathCount int: The number of shortest paths to find.

public DirectedPath<TWeight> GetPath(int rank)

public bool HasPath(int k)