Represents an edge, i.e., a directed connection between two nodes (represented
by instances of class
Node
) in the directed graph data type
Graph
.
Namespace: yWorks.yFiles.AlgorithmsAssembly: yWorks.yFilesNET.Algorithms (in yWorks.yFilesNET.Algorithms.dll) Version: 4.1.0.1 (4.1.0.1)
Syntax
| C# |
|---|
public class Edge : GraphObject |
| Visual Basic |
|---|
Public Class Edge _ Inherits GraphObject |
Remarks
Represents an edge, i.e., a directed connection between two nodes (represented
by instances of class
Node
) in the directed graph data type
Graph
.
The directed stems from the fact that an edge has a distinct source node and a distinct target node. Using pair notation, an edge would be written as (<source node>, <target node>). Most notably, an edge provides access to its source node ( Source ) and its target node ( Target ). Note that an edge can have the same node as its source and target. Such an edge is then called "self-loop" and method SelfLoop yields trueTruetruetrue (True in Visual Basic). 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.
The directed stems from the fact that an edge has a distinct source node and a distinct target node. Using pair notation, an edge would be written as (<source node>, <target node>). Most notably, an edge provides access to its source node ( Source ) and its target node ( Target ). Note that an edge can have the same node as its source and target. Such an edge is then called "self-loop" and method SelfLoop yields trueTruetruetrue (True in Visual Basic). 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.
Inheritance Hierarchy
See Also
