Summary
Encapsulates an edge in the graph for Dijkstra’s Algorithm, containing a weight, a label and a target node.
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 can be used to identify this edge. |
Constructors
|
Initializes a new instance of Edge<TWeight, TLabel>. |
Instance methods
| string | | Returns a string representation of this object. |
Instance properties
| TLabel | | The label on this edge. |
| Node<TWeight, TLabel> | | The node this edge points to. |
| TWeight | | The weight of this edge. Dijkstra’s Algorithm finds the path with the smallest total weight. |