Class DirectedManyToMany<T>

An algorithm to calculate many-to-many directed routes.

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

Constructors

DirectedManyToMany(Graph, WeightHandler<T>, RestrictionCollection, DirectedDykstraSource<T>[], DirectedDykstraSource<T>[], T)

Creates a new many-to-many algorithm instance.

Declaration
public DirectedManyToMany(Graph graph, WeightHandler<T> weightHandler, RestrictionCollection restrictions, DirectedDykstraSource<T>[] sources, DirectedDykstraSource<T>[] targets, T maxSearch)
Parameters
Graph graph

WeightHandler<T> weightHandler

RestrictionCollection restrictions

DirectedDykstraSource<T>[] sources

DirectedDykstraSource<T>[] targets

T maxSearch

Properties

Paths

Gets the paths.

Declaration
public EdgePath<T>[][] Paths { get; }
Property Value
EdgePath<T>[][]

Methods

DoRun(CancellationToken)

Executes the actual algorithm.

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

Overrides