N
- Node parameter type@Beta public interface MutableGraph<N> extends Graph<N>
Graph
which adds mutation methods. When mutation is not required, users
should prefer the Graph
interface.Modifier and Type | Method and Description |
---|---|
boolean |
addNode(N node)
Adds
node if it is not already present. |
boolean |
putEdge(EndpointPair<N> endpoints)
Adds an edge connecting
endpoints (in the order, if any, specified by endpoints ) if one is not already present. |
boolean |
putEdge(N nodeU,
N nodeV)
Adds an edge connecting
nodeU to nodeV if one is not already present. |
boolean |
removeEdge(EndpointPair<N> endpoints)
Removes the edge connecting
endpoints , if it is present. |
boolean |
removeEdge(N nodeU,
N nodeV)
Removes the edge connecting
nodeU to nodeV , if it is present. |
boolean |
removeNode(N node)
Removes
node if it is present; all edges incident to node will also be removed. |
adjacentNodes, allowsSelfLoops, degree, edges, equals, hasEdgeConnecting, hasEdgeConnecting, hashCode, incidentEdges, inDegree, isDirected, nodeOrder, nodes, outDegree, predecessors, successors
@CanIgnoreReturnValue boolean addNode(N node)
node
if it is not already present.
Nodes must be unique, just as Map
keys must be. They must also be non-null.
true
if the graph was modified as a result of this call@CanIgnoreReturnValue boolean putEdge(N nodeU, N nodeV)
nodeU
to nodeV
if one is not already present.
If the graph is directed, the resultant edge will be directed; otherwise, it will be undirected.
If nodeU
and nodeV
are not already present in this graph, this method will
silently add
nodeU
and nodeV
to the graph.
true
if the graph was modified as a result of this callIllegalArgumentException
- if the introduction of the edge would violate Graph.allowsSelfLoops()
@CanIgnoreReturnValue boolean putEdge(EndpointPair<N> endpoints)
endpoints
(in the order, if any, specified by endpoints
) if one is not already present.
If this graph is directed, endpoints
must be ordered and the added edge will be
directed; if it is undirected, the added edge will be undirected.
If this graph is directed, endpoints
must be ordered.
If either or both endpoints are not already present in this graph, this method will silently
add
each missing endpoint to the graph.
true
if the graph was modified as a result of this callIllegalArgumentException
- if the introduction of the edge would violate Graph.allowsSelfLoops()
IllegalArgumentException
- if the endpoints are unordered and the graph is directed@CanIgnoreReturnValue boolean removeNode(N node)
node
if it is present; all edges incident to node
will also be removed.true
if the graph was modified as a result of this call@CanIgnoreReturnValue boolean removeEdge(N nodeU, N nodeV)
nodeU
to nodeV
, if it is present.true
if the graph was modified as a result of this call@CanIgnoreReturnValue boolean removeEdge(EndpointPair<N> endpoints)
endpoints
, if it is present.
If this graph is directed, endpoints
must be ordered.
true
if the graph was modified as a result of this callIllegalArgumentException
- if the endpoints are unordered and the graph is directedCopyright © 2010–2019. All rights reserved.