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

Constructors

BidirectionalDykstra(DirectedMetaGraph, RestrictionCollection, IEnumerable<EdgePath<Single>>, IEnumerable<EdgePath<Single>>)

Creates a new contracted bidirectional router.

Declaration
public BidirectionalDykstra(DirectedMetaGraph graph, RestrictionCollection restrictions, IEnumerable<EdgePath<float>> sources, IEnumerable<EdgePath<float>> targets)
Parameters
DirectedMetaGraph graph

RestrictionCollection restrictions

IEnumerable<EdgePath<System.Single>> sources

IEnumerable<EdgePath<System.Single>> targets