Class BidirectionalDykstra

An algorithm to calculate a point-to-point route based on a contraction hierarchy.

Inheritance

System.Object

AlgorithmBase

BidirectionalDykstra<System.Single>

BidirectionalDykstra

Inherited Members

BidirectionalDykstra<Single>.DoRun(CancellationToken)

BidirectionalDykstra<Single>.Best

BidirectionalDykstra<Single>.TryGetForwardVisit(UInt32, EdgePath<Single>)

BidirectionalDykstra<Single>.TryGetBackwardVisit(UInt32, EdgePath<Single>)

BidirectionalDykstra<Single>.GetPath()

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 class BidirectionalDykstra : BidirectionalDykstra<float>, IAlgorithm

Constructors

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

Creates a new contracted bidirectional router.

Declaration

public BidirectionalDykstra(DirectedDynamicGraph graph, IEnumerable<EdgePath<float>> sources, IEnumerable<EdgePath<float>> targets, Func<uint, IEnumerable<uint[]>> getRestrictions)

Parameters

DirectedDynamicGraph graph

IEnumerable<EdgePath<System.Single>> sources

IEnumerable<EdgePath<System.Single>> targets

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