The Node type exposes the following members.

Constructors

  NameDescription
Protected methodNode
Instantiates a new Node object that will be part of the given graph.

Methods

  NameDescription
Public methodCreateCopy
Creates a copy of this node that will be inserted into the given graph.
Public methodEquals
Determines whether the specified Object is equal to the current Object.
(Inherited from Object.)
Protected methodFinalize
Allows an object to try to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.
(Inherited from Object.)
Public methodGetEdge
Returns an edge that connects this node with the given node, if such an edge exists.
Public methodGetEdgeCursor
Returns an edge cursor for all incoming and outgoing edges at this node.
Public methodGetEdgeFrom
Returns an incoming edge that connects the given node with this node, if such an edge exists.
Public methodGetEdgeTo
Returns an outgoing edge that connects this node with the given node, if such an edge exists.
Public methodGetHashCode
Serves as a hash function for a particular type.
(Inherited from Object.)
Public methodGetInEdgeCursor()()()()
Returns an edge cursor for all incoming edges at this node.
Public methodGetInEdgeCursor(Edge)
Returns an edge cursor for incoming edges at this node.
Public methodGetNeighborCursor
Returns a node cursor for all neighbor nodes of this node.
Public methodGetOutEdgeCursor()()()()
Returns an edge cursor for all outgoing edges at this node.
Public methodGetOutEdgeCursor(Edge)
Returns an edge cursor for outgoing edges at this node.
Public methodGetPredecessorCursor
Returns a node cursor for all predecessor nodes of this node.
Public methodGetSuccessorCursor
Returns a node cursor for all successor nodes of this node.
Public methodGetType
Gets the Type of the current instance.
(Inherited from Object.)
Protected methodMemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)
Public methodSortInEdges
Sorts incoming edges at this node according to the given comparator.
Public methodSortOutEdges
Sorts outgoing edges at this node according to the given comparator.
Public methodToString
Returns a String representation of this node.
(Overrides Object..::..ToString()()()().)

Properties

  NameDescription
Public propertyDegree
The overall number of incoming and outgoing edges at this node.
Public propertyEdges
Yields a dynamic IEnumerable<(Of <(<'T>)>)> for Edges that can be used to iterate over the adjacent edges at this instance.
Public propertyFirstInEdge
The first incoming edge at this node, or nullNothingnullptra null reference (Nothing in Visual Basic) if it does not exist.
Public propertyFirstOutEdge
The first outgoing edge at this node, or nullNothingnullptra null reference (Nothing in Visual Basic) if it does not exist.
Public propertyGraph
The graph this node belongs to.
Public propertyInDegree
The number of incoming edges at this node.
Public propertyIndex
The index of this node within its graph G.
Public propertyInEdges
Yields a dynamic IEnumerable<(Of <(<'T>)>)> for Edges that can be used to iterate over ingoing edges at this instance.
Public propertyLastInEdge
The last incoming edge at this node, or nullNothingnullptra null reference (Nothing in Visual Basic) if it does not exist.
Public propertyLastOutEdge
The last outgoing edge at this node, or nullNothingnullptra null reference (Nothing in Visual Basic) if it does not exist.
Public propertyNeighbors
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.
Public propertyOutDegree
The number of outgoing edges at this node.
Public propertyOutEdges
Yields a dynamic IEnumerable<(Of <(<'T>)>)> for Edges that can be used to iterate over outgoing edges at this instance.
Public propertyPredecessors
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.
Public propertySuccessors
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.

See Also