This provides an abstract view of a diagram as a network (graph) of vertexes and directed edges. The network contains vertexes and edges corresponding to Nodes and Links.
This constructs an empty network.
Gets a collection of all of the LayoutEdges in this network.
Gets the Layout that uses this network of LayoutVertexes and LayoutEdges.
Gets a collection of all of the LayoutVertexes in this network.
Adds a LayoutEdge to the network.
any
This convenience method makes sure there is a LayoutEdge in this network corresponding to a Link.
This convenience method makes sure there is a LayoutVertex in this network corresponding to a Node.
Creates a network of LayoutVertexes and LayoutEdges corresponding to the given Nodes and Links.
A collection of Nodes or Links.
whether to skip Parts in the given collection that are contained by Groups.
any
Adds a LayoutVertex to the network.
any
Allocate a new instance of LayoutEdge.
Allocate a new instance of LayoutVertex.
Deletes all vertexes and edges that have no Part associated with them.
any
Removes a LayoutEdge from the network.
any
This convenience method deletes from this network any LayoutEdge corresponding to a Link.
any
This convenience method deletes any LayoutVertex corresponding to a Node.
any
Deletes all LayoutEdges whose "to vertex" and "from vertex" are the same vertex.
any
Removes a LayoutVertex from the network.
any
Retrieve all of the Nodes and Links from the LayoutVertexes and LayoutEdges that are in this network.
Returns the LayoutEdge that was constructed for the Link.
Returns the LayoutVertex that was constructed for the Node.
Links two vertexes already in the network and returns the created LayoutEdge.
Reverses the direction of a LayoutEdge in the network.
any
Modify this network by splitting it up into separate subnetworks, each of which has all of its vertexes connected to each other, but not to any vertexes in any other subnetworks.