com.google.common.graph

Interface MutableNetwork<N,E>

Type Parameters:

N - Node parameter type

E - Edge parameter type

All Superinterfaces:

Network<N,E>, PredecessorsFunction<N>, SuccessorsFunction<N>

@Beta
public interface MutableNetwork<N,E>
extends Network<N,E>

A subinterface of Network which adds mutation methods. When mutation is not required, users should prefer the Network interface.

Since:

20.0

Author:

James Sexton, Joshua O'Madadhain

Method Summary

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.
boolean	removeEdge(E edge) Removes edge from this network, if it is present.
boolean	removeNode(N node) Removes node if it is present; all edges incident to node will also be removed.

Methods inherited from interface com.google.common.graph.Network

adjacentEdges, adjacentNodes, allowsParallelEdges, allowsSelfLoops, asGraph, degree, edgeConnecting, edgeConnectingOrNull, edgeOrder, edges, edgesConnecting, equals, hasEdgeConnecting, hashCode, incidentEdges, incidentNodes, inDegree, inEdges, isDirected, nodeOrder, nodes, outDegree, outEdges, predecessors, successors

Method Detail

addNode

@CanIgnoreReturnValue
boolean addNode(N node)

Adds node if it is not already present.

Nodes must be unique, just as Map keys must be. They must also be non-null.

Returns:

true if the network was modified as a result of this call

addEdge

@CanIgnoreReturnValue
boolean addEdge(N nodeU,
                                      N nodeV,
                                      E edge)

Adds 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.

If nodeU and nodeV are not already present in this graph, this method will silently add nodeU and nodeV to the graph.

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.

Returns:

true if the network was modified as a result of this call

Throws:

IllegalArgumentException - if edge already exists and does not connect nodeU to nodeV, or if the introduction of the edge would violate Network.allowsParallelEdges() or Network.allowsSelfLoops()

removeNode

@CanIgnoreReturnValue
boolean removeNode(N node)

Removes node if it is present; all edges incident to node will also be removed.

Returns:

true if the network was modified as a result of this call

removeEdge

@CanIgnoreReturnValue
boolean removeEdge(E edge)

Removes edge from this network, if it is present.

Returns:

true if the network was modified as a result of this call