N
- Node parameter typeV
- Value parameter typefinal class ConfigurableMutableValueGraph<N,V> extends ConfigurableValueGraph<N,V> implements MutableValueGraph<N,V>
MutableValueGraph
that supports both directed and
undirected graphs. Instances of this class should be constructed with ValueGraphBuilder
.
Time complexities for mutation methods are all O(1) except for removeNode(N node)
,
which is in O(d_node) where d_node is the degree of node
.
edgeCount, nodeConnections
Constructor and Description |
---|
ConfigurableMutableValueGraph(AbstractGraphBuilder<? super N> builder)
Constructs a mutable graph with the properties specified in
builder . |
Modifier and Type | Method and Description |
---|---|
boolean |
addNode(N node)
Adds
node if it is not already present. |
private GraphConnections<N,V> |
addNodeInternal(N node)
Adds
node to the graph and returns the associated GraphConnections . |
private GraphConnections<N,V> |
newConnections() |
V |
putEdgeValue(EndpointPair<N> endpoints,
V value)
Adds an edge connecting
endpoints if one is not already present, and sets a value for
that edge to value (overwriting the existing value, if any). |
V |
putEdgeValue(N nodeU,
N nodeV,
V value)
Adds an edge connecting
nodeU to nodeV if one is not already present, and sets
a value for that edge to value (overwriting the existing value, if any). |
V |
removeEdge(EndpointPair<N> endpoints)
Removes the edge connecting
endpoints , if it is present. |
V |
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, checkedConnections, containsNode, edgeCount, edgeValueOrDefault_internal, edgeValueOrDefault, edgeValueOrDefault, hasEdgeConnecting_internal, hasEdgeConnecting, hasEdgeConnecting, isDirected, nodeOrder, nodes, predecessors, successors
asGraph, edgeValue, edgeValue, equals, hashCode, toString
degree, edges, incidentEdges, inDegree, isOrderingCompatible, outDegree, validateEndpoints
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
adjacentNodes, allowsSelfLoops, asGraph, degree, edges, edgeValue, edgeValue, edgeValueOrDefault, edgeValueOrDefault, equals, hasEdgeConnecting, hasEdgeConnecting, hashCode, incidentEdges, inDegree, isDirected, nodeOrder, nodes, outDegree, predecessors, successors
ConfigurableMutableValueGraph(AbstractGraphBuilder<? super N> builder)
builder
.public boolean addNode(N node)
MutableValueGraph
node
if it is not already present.
Nodes must be unique, just as Map
keys must be. They must also be non-null.
addNode
in interface MutableValueGraph<N,V>
true
if the graph was modified as a result of this callprivate GraphConnections<N,V> addNodeInternal(N node)
node
to the graph and returns the associated GraphConnections
.java.lang.IllegalStateException
- if node
is already presentpublic V putEdgeValue(N nodeU, N nodeV, V value)
MutableValueGraph
nodeU
to nodeV
if one is not already present, and sets
a value for that edge to value
(overwriting the existing value, if any).
If the graph is directed, the resultant edge will be directed; otherwise, it will be undirected.
Values do not have to be unique. However, values must be non-null.
If nodeU
and nodeV
are not already present in this graph, this method will
silently add
nodeU
and nodeV
to the graph.
putEdgeValue
in interface MutableValueGraph<N,V>
nodeU
to nodeV
, or null if there was no such edge.public V putEdgeValue(EndpointPair<N> endpoints, V value)
MutableValueGraph
endpoints
if one is not already present, and sets a value for
that edge to value
(overwriting the existing value, if any).
If the graph is directed, the resultant edge will be directed; otherwise, it will be undirected.
If this graph is directed, endpoints
must be ordered.
Values do not have to be unique. However, values must be non-null.
If either or both endpoints are not already present in this graph, this method will silently
add
each missing endpoint to the graph.
putEdgeValue
in interface MutableValueGraph<N,V>
nodeU
to nodeV
, or null if there was no such edge.public boolean removeNode(N node)
MutableValueGraph
node
if it is present; all edges incident to node
will also be removed.removeNode
in interface MutableValueGraph<N,V>
true
if the graph was modified as a result of this callpublic V removeEdge(N nodeU, N nodeV)
MutableValueGraph
nodeU
to nodeV
, if it is present.removeEdge
in interface MutableValueGraph<N,V>
nodeU
to nodeV
, or null if there was no such edge.public V removeEdge(EndpointPair<N> endpoints)
MutableValueGraph
endpoints
, if it is present.
If this graph is directed, endpoints
must be ordered.
removeEdge
in interface MutableValueGraph<N,V>
endpoints
, or null if
there was no such edge.private GraphConnections<N,V> newConnections()