Summary
Describes a step in the path returned by
DijkstrasAlgorithm.Run<TWeight, TLabel>(Node<TWeight, TLabel>, TWeight, Func<TWeight, TWeight, TWeight>, out TWeight).
Generic type parameters
TWeight |
Type of the weight (or length or any other quantity to be minimized) of each edge between nodes. |
TLabel |
Type that is used to identify edges. |
Constructors
Instance methods
Instance properties
TLabel | |
The label of the edge connecting this Step<TWeight, TLabel>.Node to the next. Note that if Step<TWeight, TLabel>.Node has Node<TWeight, TLabel>.IsFinal equal to true , this value is meaningless and should be ignored. |
Node<TWeight, TLabel> | |
The node from which this step originates. If this node has Node<TWeight, TLabel>.IsFinal equal
to true , this represents the end of the path. |