N
- Node parameter typeE
- Edge parameter typefinal class ConfigurableMutableNetwork<N,E> extends ConfigurableNetwork<N,E> implements MutableNetwork<N,E>
MutableNetwork
that supports both directed and undirected
graphs. Instances of this class should be constructed with NetworkBuilder
.
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
.
edgeToReferenceNode, nodeConnections
Constructor and Description |
---|
ConfigurableMutableNetwork(NetworkBuilder<? super N,? super E> builder)
Constructs a mutable graph with the properties specified in
builder . |
Modifier and Type | Method and Description |
---|---|
boolean |
addEdge(N nodeU,
N nodeV,
E edge)
Adds
edge connecting nodeU to nodeV . |
boolean |
addNode(N node)
Adds
node if it is not already present. |
private NetworkConnections<N,E> |
addNodeInternal(N node)
Adds
node to the graph and returns the associated NetworkConnections . |
private NetworkConnections<N,E> |
newConnections() |
boolean |
removeEdge(java.lang.Object edge)
Removes
edge from this network, if it is present. |
boolean |
removeNode(java.lang.Object node)
Removes
node if it is present; all edges incident to node will also be removed. |
adjacentNodes, allowsParallelEdges, allowsSelfLoops, checkedConnections, checkedReferenceNode, containsEdge, containsNode, edgeOrder, edges, edgesConnecting, incidentEdges, incidentNodes, inEdges, isDirected, nodeOrder, nodes, outEdges, predecessors, successors
adjacentEdges, asGraph, degree, inDegree, outDegree, toString
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
adjacentEdges, adjacentNodes, allowsParallelEdges, allowsSelfLoops, asGraph, degree, edgeOrder, edges, edgesConnecting, equals, hashCode, incidentEdges, incidentNodes, inDegree, inEdges, isDirected, nodeOrder, nodes, outDegree, outEdges, predecessors, successors
ConfigurableMutableNetwork(NetworkBuilder<? super N,? super E> builder)
builder
.public boolean addNode(N node)
MutableNetwork
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 MutableNetwork<N,E>
true
if the network was modified as a result of this callprivate NetworkConnections<N,E> addNodeInternal(N node)
node
to the graph and returns the associated NetworkConnections
.java.lang.IllegalStateException
- if node
is already presentpublic boolean addEdge(N nodeU, N nodeV, E edge)
MutableNetwork
edge
connecting nodeU
to nodeV
. In an undirected network, the edge
will also connect nodeV
to nodeU
.
Edges must be unique, just as Map
keys must be. They must also be non-null.
Behavior if nodeU
and nodeV
are not already present in this network is
implementation-dependent. Suggested behaviors include (a) silently adding
nodeU
and nodeV
to the network (this is the behavior of the default
implementations) or (b) throwing IllegalArgumentException
.
If edge
already connects nodeU
to nodeV
(in the specified order if
this network Network.isDirected()
, else in any order), then this method will have no effect.
addEdge
in interface MutableNetwork<N,E>
true
if the network was modified as a result of this callpublic boolean removeNode(java.lang.Object node)
MutableNetwork
node
if it is present; all edges incident to node
will also be removed.removeNode
in interface MutableNetwork<N,E>
true
if the network was modified as a result of this callpublic boolean removeEdge(java.lang.Object edge)
MutableNetwork
edge
from this network, if it is present.removeEdge
in interface MutableNetwork<N,E>
true
if the network was modified as a result of this callprivate NetworkConnections<N,E> newConnections()