Show / Hide Table of Contents

Class ManyToManyBidirectionalDykstra<T>

An algorithm to calculate many-to-many weights based on a contraction hierarchy.

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

Constructors

ManyToManyBidirectionalDykstra(RouterDb, Profile, WeightHandler<T>, RouterPoint[], RouterPoint[], T)

Creates a new algorithm.

Declaration
public ManyToManyBidirectionalDykstra(RouterDb routerDb, Profile profile, WeightHandler<T> weightHandler, RouterPoint[] sources, RouterPoint[] targets, T max)
Parameters
RouterDb routerDb

Profile profile

WeightHandler<T> weightHandler

RouterPoint[] sources

RouterPoint[] targets

T max

Methods

DoRun(CancellationToken)

Executes the actual run.

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

Overrides
AlgorithmBase.DoRun(CancellationToken)

GetPath(Int32, Int32)

Gets the paths.

Declaration
public EdgePath<T> GetPath(int source, int target)
Parameters
System.Int32 source

System.Int32 target

Returns
EdgePath<T>

Back to top Built by Itinero, MIT licensed.