- successorListOf
Returns a list of vertices that are the direct successors of a specified vertex.
If the graph is a m
- predecessorListOf
Returns a list of vertices that are the direct predecessors of a specified
vertex. If the graph is a
- getOppositeVertex
Gets the vertex opposite another vertex across an edge.
- neighborListOf
Returns a list of vertices that are the neighbors of a specified vertex. If the
graph is a multigrap
- addGraph
Adds all the vertices and all the edges of the specified source graph to the
specified destination g
- addAllEdges
Adds a subset of the edges of the specified source graph to the specified
destination graph. The beh
- addAllVertices
Adds all of the specified vertices to the destination graph. The behavior of
this operation is undef
- addEdgeWithVertices
Adds the specified edge to the graph, including its vertices if not already
included.
- getPathVertexList
- addEdge
Creates a new edge and adds it to the specified graph similarly to the
Graph#addEdge(Object,Object)
- addGraphReversed
Adds all the vertices and all the edges of the specified source digraph to the
specified destination
- getVertexToIntegerMapping
Compute a new mapping from the vertices of a graph to the integer range $[0, n)$
where $n$ is the nu