Class Dykstra

An implementation of the dykstra routing algorithm.

Inheritance

System.Object

AlgorithmBase

Dykstra<System.Single>

Dykstra

Inherited Members

Dykstra<Single>.DoRun(CancellationToken)

Dykstra<Single>.Initialize()

Dykstra<Single>.Step()

Dykstra<Single>.TryGetVisits(UInt32, LinkedEdgePath<Single>)

Dykstra<Single>.TryGetVisit(UInt32, EdgePath<Single>)

Dykstra<Single>.WasFound

Dykstra<Single>.Backward

Dykstra<Single>.Graph

Dykstra<Single>.Current

AlgorithmBase.HasRun

AlgorithmBase.HasSucceeded

AlgorithmBase.ErrorMessage

AlgorithmBase.CheckHasRun()

AlgorithmBase.CheckHasRunAndHasSucceeded()

AlgorithmBase.Run()

AlgorithmBase.Run(CancellationToken)

System.Object.ToString()

System.Object.Equals(System.Object)

System.Object.Equals(System.Object, System.Object)

System.Object.ReferenceEquals(System.Object, System.Object)

System.Object.GetHashCode()

System.Object.GetType()

System.Object.MemberwiseClone()

Namespace: System.Dynamic.ExpandoObject

Assembly: cs.temp.dll.dll

Syntax

public sealed class Dykstra : Dykstra<float>, IAlgorithm

Constructors

Dykstra(DirectedDynamicGraph, IEnumerable<EdgePath<Single>>, Func<UInt32, IEnumerable<UInt32[]>>, Boolean, Single)

Creates a new routing algorithm instance.

Declaration

public Dykstra(DirectedDynamicGraph graph, IEnumerable<EdgePath<float>> sources, Func<uint, IEnumerable<uint[]>> getRestrictions, bool backward, float max = 3.40282347E+38F)

Parameters

DirectedDynamicGraph graph

IEnumerable<EdgePath<System.Single>> sources

Func<System.UInt32, IEnumerable<System.UInt32[]>> getRestrictions

System.Boolean backward

System.Single max