Represents a so-called node in the directed graph data type Graph .Namespace: yWorks.yFiles.Algorithms
Assembly: yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 188.8.131.52
Represents a so-called node in the directed graph data type Graph . Most notably, a node provides access to its adjacent edges (represented by instances of class Edge ). These can be distinguished into the sets of incoming and outgoing edges. Iteration over all three sets of edges is provided by means of bidirectional cursors that present a read-only view of the respective set ( GetEdgeCursor()()()() , GetInEdgeCursor()()()() , GetOutEdgeCursor()()()() ). Also supported is iteration over all nodes at opposite ends of either incoming edges or outgoing edges ( GetPredecessorCursor()()()() , GetSuccessorCursor()()()() ). The number of overall edges at a node is called its degree ( Degree ), which is the sum of incoming and outgoing edges ( InDegree , OutDegree ). Important: Class Graph is the single authority for any structural changes to the graph data type. Specifically, this means that there is no way to create or delete a node or an edge without using an actual Graph instance.