The Node type exposes the following members.
Constructors
Name | Description | |
---|---|---|
![]() | Node | Instantiates a new Node object that will be part of the given graph. |
Methods
Name | Description | |
---|---|---|
![]() | CreateCopy | Creates a copy of this node that will be inserted into the given graph. |
![]() | Equals | Determines whether the specified Object is equal to the current Object. (Inherited from Object.) |
![]() | Finalize | Allows an object to try to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. (Inherited from Object.) |
![]() | GetEdge |
Returns an edge that connects this node with the given node, if such an edge
exists.
|
![]() | GetEdgeCursor | Returns an edge cursor for all incoming and outgoing edges at this node. |
![]() | GetEdgeFrom |
Returns an incoming edge that connects the given node with this node, if such
an edge exists.
|
![]() | GetEdgeTo |
Returns an outgoing edge that connects this node with the given node, if such
an edge exists.
|
![]() | GetHashCode | Serves as a hash function for a particular type. (Inherited from Object.) |
![]() | GetInEdgeCursor()()()() | Returns an edge cursor for all incoming edges at this node. |
![]() | GetInEdgeCursor(Edge) | Returns an edge cursor for incoming edges at this node. |
![]() | GetNeighborCursor | Returns a node cursor for all neighbor nodes of this node. |
![]() | GetOutEdgeCursor()()()() | Returns an edge cursor for all outgoing edges at this node. |
![]() | GetOutEdgeCursor(Edge) | Returns an edge cursor for outgoing edges at this node. |
![]() | GetPredecessorCursor | Returns a node cursor for all predecessor nodes of this node. |
![]() | GetSuccessorCursor | Returns a node cursor for all successor nodes of this node. |
![]() | GetType | Gets the Type of the current instance. (Inherited from Object.) |
![]() | MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
![]() | SortInEdges | Sorts incoming edges at this node according to the given comparator. |
![]() | SortOutEdges | Sorts outgoing edges at this node according to the given comparator. |
![]() | ToString | Returns a String representation of this node. (Overrides Object..::..ToString()()()().) |
Properties
Name | Description | |
---|---|---|
![]() | Degree | The overall number of incoming and outgoing edges at this node. |
![]() | Edges |
Yields a dynamic IEnumerable<(Of <(<'T>)>)>
for Edges that can be used to iterate over the adjacent edges at this instance.
|
![]() | FirstInEdge |
The first incoming edge at this node, or nullNothingnullptra null reference (Nothing in Visual Basic) if it does
not exist.
|
![]() | FirstOutEdge |
The first outgoing edge at this node, or nullNothingnullptra null reference (Nothing in Visual Basic) if it does
not exist.
|
![]() | Graph | The graph this node belongs to. |
![]() | InDegree | The number of incoming edges at this node. |
![]() | Index | The index of this node within its graph G. |
![]() | InEdges |
Yields a dynamic IEnumerable<(Of <(<'T>)>)>
for Edges that can be used to iterate over ingoing edges at this instance.
|
![]() | LastInEdge |
The last incoming edge at this node, or nullNothingnullptra null reference (Nothing in Visual Basic) if it does
not exist.
|
![]() | LastOutEdge |
The last outgoing edge at this node, or nullNothingnullptra null reference (Nothing in Visual Basic) if it does
not exist.
|
![]() | Neighbors |
Yields a dynamic IEnumerable<(Of <(<'T>)>)>
for Nodes that can be used to iterate over the opposite sides of adjacent adjacent edges at this instance.
|
![]() | OutDegree | The number of outgoing edges at this node. |
![]() | OutEdges |
Yields a dynamic IEnumerable<(Of <(<'T>)>)>
for Edges that can be used to iterate over outgoing edges at this instance.
|
![]() | Predecessors |
Yields a dynamic IEnumerable<(Of <(<'T>)>)>
for Nodes that can be used to iterate over the opposite sides of adjacent incoming edges at this instance.
|
![]() | Successors |
Yields a dynamic IEnumerable<(Of <(<'T>)>)>
for Nodes that can be used to iterate over the opposite sides of adjacent outgoing edges at this instance.
|