Show / Hide Table of Contents

Class DirectedDykstra<T>

An implementation of a directed edge-based dykstra routing algorithm.

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

Constructors

DirectedDykstra(Graph, WeightHandler<T>, RestrictionCollection, DirectedDykstraSource<T>, T, Boolean)

Creates a new one-to-all dykstra algorithm instance.

Declaration
public DirectedDykstra(Graph graph, WeightHandler<T> weightHandler, RestrictionCollection restrictions, DirectedDykstraSource<T> source, T sourceMax, bool backward)
Parameters
Graph graph

WeightHandler<T> weightHandler

RestrictionCollection restrictions

DirectedDykstraSource<T> source

T sourceMax

System.Boolean backward

DirectedDykstra(Graph, WeightHandler<T>, RestrictionCollection, DirectedEdgeId, T, Boolean)

Creates a new one-to-all dykstra algorithm instance.

Declaration
public DirectedDykstra(Graph graph, WeightHandler<T> weightHandler, RestrictionCollection restrictions, DirectedEdgeId source, T sourceMax, bool backward)
Parameters
Graph graph

WeightHandler<T> weightHandler

RestrictionCollection restrictions

DirectedEdgeId source

T sourceMax

System.Boolean backward

Properties

Backward

Gets the backward flag.

Declaration
public bool Backward { get; }
Property Value
System.Boolean

Graph

Gets the graph.

Declaration
public Graph Graph { get; }
Property Value
Graph

MaxReached

Gets the max reached flag.

Declaration
public bool MaxReached { get; }
Property Value
System.Boolean

Remarks

True if the source-max value was reached.

WasFound

Gets or sets the wasfound function to be called when a new vertex is found.

Declaration
public DirectedDykstra<T>.WasFoundDelegate WasFound { get; set; }
Property Value
DirectedDykstra.WasFoundDelegate<>

Methods

DoRun(CancellationToken)

Executes the algorithm.

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

Overrides
AlgorithmBase.DoRun(CancellationToken)

GetPath(UInt32)

Gets the path for the vertex at the given pointer.

Declaration
public EdgePath<T> GetPath(uint pointer)
Parameters
System.UInt32 pointer

Returns
EdgePath<T>

GetWeight(UInt32)

Gets the weight for the vertex at the given pointer.

Declaration
public T GetWeight(uint pointer)
Parameters
System.UInt32 pointer

Returns
T

Initialize()

Initializes and resets.

Declaration
public void Initialize()

Step()

Executes one step in the search.

Declaration
public bool Step()
Returns
System.Boolean

Back to top Built by Itinero, MIT licensed.