Abstract class: RT.Dijkstra.Node<TWeight, TLabel>

• Assembly: RT.Dijkstra, Version=1.0.0.0, Culture=neutral, PublicKeyToken=null
• Namespace: RT.Dijkstra
• Show inherited types...
  Inherits from:

  • object
• Show implemented interfaces...
  Implements:

  • System.IEquatable<RT.Dijkstra.Node<TWeight, TLabel>> (directly)

Summary

Base class for nodes in a graph on which Dijkstra’s Algorithm is run using 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 can be used to identify edges connecting nodes.

Instance methods

bool	Equals(Node<TWeight, TLabel> other) Implements: IEquatable<Node<TWeight, TLabel>>.Equals(Node<TWeight, TLabel>) Abstract	When overridden in a derived class, compares two nodes for equality.
int	GetHashCode() Overrides: object.GetHashCode() Abstract	When overridden in a derived class, returns a hash code for this node.

Instance properties

IEnumerable<Edge<TWeight, TLabel>>	Edges Abstract	When overridden in a derived class, returns the set of edges going out from this node. Each edge consists of a label that identifies the edge, and the node that the edge points to.
bool	IsFinal Abstract	When overridden in a derived class, determines whether this node is “final”. The final nodes are the nodes the algorithm is looking for. The first such node encountered in the search ends the search with success.