// Every edge incident on the nodes in this collection, deduped — answered off the CSR adjacency index, so it is O(incident edges) rather than a scaneles.connectedEdges(criterion?: FilterLike<NodeData, EdgeData, EdgeData, NodeData | EdgeData>): Collection<NodeData, EdgeData, EdgeData>
Every edge incident on the nodes in this collection, deduped — answered off the CSR adjacency index, so it is O(incident edges) rather than a scan. Loops appear once.
// The endpoint nodes of every edge in this collection, dedupedeles.connectedNodes(criterion?: FilterLike<NodeData, EdgeData, NodeData, NodeData | EdgeData>): Collection<NodeData, EdgeData, NodeData>
The endpoint nodes of every edge in this collection, deduped.
// The immediate outgoing neighbourhood: the edges leaving these nodes plus the nodes they point ateles.outgoers(criterion?: FilterLike<NodeData, EdgeData>): Collection<NodeData, EdgeData>
The immediate outgoing neighbourhood: the edges leaving these nodes plus the nodes they point at. One hop only — use successors() for the transitive closure.
// The immediate incoming neighbourhood: the edges arriving at these nodes plus the nodes they come fromeles.incomers(criterion?: FilterLike<NodeData, EdgeData>): Collection<NodeData, EdgeData>
The immediate incoming neighbourhood: the edges arriving at these nodes plus the nodes they come from. One hop only — use predecessors() for the transitive closure.
// The open neighbourhood: the incident edges and the nodes on their far ends, ignoring edge direction, excluding the collection's own elementseles.neighborhood(criterion?: FilterLike<NodeData, EdgeData>): Collection<NodeData, EdgeData>
The open neighbourhood: the incident edges and the nodes on their far ends, ignoring edge direction, excluding the collection's own elements.
// The open neighbourhood plus this collection's own nodeseles.closedNeighborhood(criterion?: FilterLike<NodeData, EdgeData>): Collection<NodeData, EdgeData>
The open neighbourhood plus this collection's own nodes.
// Everything reachable by following outgoing edges, transitively — the edges and nodes of the forward closure, excluding these nodes themselves (unless a cycle reaches them)eles.successors(criterion?: FilterLike<NodeData, EdgeData>): Collection<NodeData, EdgeData>
Everything reachable by following outgoing edges, transitively — the edges and nodes of the forward closure, excluding these nodes themselves (unless a cycle reaches them).
// Everything that reaches these nodes by following incoming edges, transitivelyeles.predecessors(criterion?: FilterLike<NodeData, EdgeData>): Collection<NodeData, EdgeData>
Everything that reaches these nodes by following incoming edges, transitively.
// The edges connecting this collection's nodes with others, in either directioneles.edgesWith(others: Collection): Collection<NodeData, EdgeData, EdgeData>
The edges connecting this collection's nodes with others, in either direction.
// The edges running from this collection's nodes to others — edgesWith() restricted by directioneles.edgesTo(others: Collection): Collection<NodeData, EdgeData, EdgeData>
The edges running from this collection's nodes toothers — edgesWith() restricted by direction.
// The edges sharing endpoints with these edges, in either direction — including each edge itselfeles.parallelEdges(criterion?: FilterLike<NodeData, EdgeData, EdgeData, NodeData | EdgeData>): Collection<NodeData, EdgeData, EdgeData>
The edges sharing endpoints with these edges, in either direction — including each edge itself. These are the edges a bezier bundle fans apart.
// The parallel edges pointing the same way — same source and same target — including each edge itselfeles.codirectedEdges(criterion?: FilterLike<NodeData, EdgeData, EdgeData, NodeData | EdgeData>): Collection<NodeData, EdgeData, EdgeData>
The parallel edges pointing the same way — same source and same target — including each edge itself.
// Connected components within this collection (undirected), each as a collection of the reached nodes plus the collection's edges internal to that componenteles.components(root?: Collection | null): Collection<NodeData, EdgeData>[]
Connected components within this collection (undirected), each as a collection of the reached nodes plus the collection's edges internal to that component.
the component as nodes and their connecting edges, computed over the whole graph rather than within this collection; an empty collection when this one is empty