UnindexedReadonlyedgesGets a collection of all of the LayoutEdges in this network. Do not modify this collection directly. Instead, call addEdge, deleteEdge, addLink, or deleteLink.
ReadonlylayoutGets the Layout that uses this network of LayoutVertexes and LayoutEdges. The default value is null. It is set automatically for you when this setting Layout.network.
ReadonlyvertexesGets a collection of all of the LayoutVertexes in this network. Do not modify this collection directly. Instead, call addVertex, deleteVertex, addNode, or deleteNode.
Adds a LayoutEdge to the network. Although this method is provided for completeness, linkVertexes provides a more efficient manner of linking vertexes already in the network.
This convenience method makes sure there is a LayoutEdge in this network corresponding to a Link. If findEdge returns null, this method creates a new LayoutEdge, makes sure the Link.fromNode and Link.toNode have corresponding LayoutVertexes in the network, and adds the edge itself to the network.
an edge in this network.
This convenience method makes sure there is a LayoutVertex in this network corresponding to a Node.
a vertex in this network.
Creates a network of LayoutVertexes and LayoutEdges corresponding to the given Nodes and Links. This is usually more convenient than repeatedly calling addNode and addLink. This method ignores all instances of Parts that are not Nodes or Links. This will recurse through Groups that have no Group.layout.
Optionaltoplevelonly: booleanwhether to skip Parts in the given collection that are contained by Groups; default is false
Optionalpred: ((a: Part) => boolean) | nulloptional predicate to apply to each Part -- if it returns false do not include Vertex or Edge in the network; default ignores link label nodes or links connecting with them
VirtualdeleteDeletes all vertexes and edges that have no Part associated with them.
This convenience method deletes from this network any LayoutEdge corresponding to a Link.
This convenience method deletes any LayoutVertex corresponding to a Node.
Deletes all LayoutEdges whose "to vertex" and "from vertex" are the same vertex.
Removes a LayoutVertex from the network. This function also deletes all edges to or from the vertex.
Retrieve all of the Nodes and Links from the LayoutVertexes and LayoutEdges that are in this network.
A collection of Parts.
Returns the LayoutEdge that was constructed for the Link.
an edge in this network, or null if no such edge exists.
Returns the LayoutVertex that was constructed for the Node.
a vertex in this network, or null if no such vertex exists.
Links two vertexes already in the network and returns the created LayoutEdge.
an edge in this network, or null if both vertexes don't exist.
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.
This method will first delete from this network all artificial vertexes and all edges that do not connect two different vertexes. Afterwards, this original network may be empty or may contain all of the singleton vertexes, each of which had no edges connecting it to any other vertexes.
Optionalclean: booleanwhether to delete artificial vertexes and edges, disconnected edges, and reflexive edges; default is true
a collection of LayoutNetworks, sorted in order of decreasing vertex count.
This class represents an abstract graph of CircularVertexes and CircularEdges that can be constructed based on the Nodes and Links of a Diagram so that the CircularLayout can operate independently of the diagram until it is time to commit any node positioning or link routing.
This class inherits from LayoutNetwork.