Show / Hide Table of Contents

Class BidirectionalDykstra<T>

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

Inheritance
System.Object
AlgorithmBase
BidirectionalDykstra<T>
BidirectionalDykstra
Inherited Members
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<T> : AlgorithmBase, IAlgorithm where T : struct
Type Parameters
T

Constructors

BidirectionalDykstra(DirectedMetaGraph, RestrictionCollection, WeightHandler<T>, IEnumerable<EdgePath<T>>, IEnumerable<EdgePath<T>>)

Creates a new contracted bidirectional router.

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

RestrictionCollection restrictions

WeightHandler<T> weightHandler

IEnumerable<EdgePath<T>> sources

IEnumerable<EdgePath<T>> targets

Properties

Best

Returns the vertex on the best path.

Declaration
public uint Best { get; }
Property Value
System.UInt32

Graph

Gets the graph.

Declaration
public DirectedMetaGraph Graph { get; }
Property Value
DirectedMetaGraph

Methods

DoRun(CancellationToken)

Executes the actual run.

Declaration
protected override void DoRun(CancellationToken cancellationToken)
Parameters
CancellationToken cancellationToken

Overrides
AlgorithmBase.DoRun(CancellationToken)

TryGetBackwardVisit(UInt32, out EdgePath<T>)

Returns true if the given vertex was visited and sets the visit output parameters with the actual visit data.

Declaration
public bool TryGetBackwardVisit(uint vertex, out EdgePath<T> visit)
Parameters
System.UInt32 vertex

EdgePath<T> visit

Returns
System.Boolean

TryGetForwardVisit(UInt32, out EdgePath<T>)

Returns true if the given vertex was visited and sets the visit output parameters with the actual visit data.

Declaration
public bool TryGetForwardVisit(uint vertex, out EdgePath<T> visit)
Parameters
System.UInt32 vertex

EdgePath<T> visit

Returns
System.Boolean

Back to top Built by Itinero, MIT licensed.