Package com.google.common.graph

Class ConfigurableMutableValueGraph<N,V>

java.lang.Object

com.google.common.graph.AbstractBaseGraph<N>

com.google.common.graph.AbstractValueGraph<N,V>

com.google.common.graph.ConfigurableValueGraph<N,V>

com.google.common.graph.ConfigurableMutableValueGraph<N,V>

Type Parameters:

N - Node parameter type

V - Value parameter type

All Implemented Interfaces:

BaseGraph<N>, MutableValueGraph<N,V>, PredecessorsFunction<N>, SuccessorsFunction<N>, ValueGraph<N,V>

final class ConfigurableMutableValueGraph<N,V>
extends ConfigurableValueGraph<N,V>
implements MutableValueGraph<N,V>

Configurable implementation of 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.

Field Summary

Fields inherited from class com.google.common.graph.ConfigurableValueGraph

edgeCount, nodeConnections

Constructor Summary

Constructors

Constructor	Description
ConfigurableMutableValueGraph(AbstractGraphBuilder<? super N> builder)	Constructs a mutable graph with the properties specified in builder.

Method Summary

Modifier and Type	Method	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(N nodeU, N nodeV, V value)	Adds an edge connecting nodeU to nodeV if one is not already present; associate that edge with value.
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.

Methods inherited from class com.google.common.graph.ConfigurableValueGraph

adjacentNodes, allowsSelfLoops, checkedConnections, containsNode, edgeCount, edgeValueOrDefault, hasEdgeConnecting, isDirected, nodeOrder, nodes, predecessors, successors

Methods inherited from class com.google.common.graph.AbstractValueGraph

asGraph, edgeValue, equals, hashCode, toString

Methods inherited from class com.google.common.graph.AbstractBaseGraph

degree, edges, incidentEdges, inDegree, outDegree

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

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

adjacentNodes, allowsSelfLoops, asGraph, degree, edges, edgeValue, edgeValueOrDefault, equals, hasEdgeConnecting, hashCode, incidentEdges, inDegree, isDirected, nodeOrder, nodes, outDegree, predecessors, successors

Constructor Detail

ConfigurableMutableValueGraph

ConfigurableMutableValueGraph(AbstractGraphBuilder<? super N> builder)

Constructs a mutable graph with the properties specified in builder.

Method Detail

addNode

public boolean addNode(N node)

Description copied from interface: MutableValueGraph

Adds node if it is not already present.

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

Specified by:

addNode in interface MutableValueGraph<N,V>

Returns:

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

addNodeInternal

private GraphConnections<N,V> addNodeInternal(N node)

Adds node to the graph and returns the associated GraphConnections.

Throws:

java.lang.IllegalStateException - if node is already present

putEdgeValue

public V putEdgeValue(N nodeU,
                      N nodeV,
                      V value)

Description copied from interface: MutableValueGraph

Adds an edge connecting nodeU to nodeV if one is not already present; associate that edge with value. In an undirected graph, the edge will also connect nodeV to nodeU.

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.

Specified by:

putEdgeValue in interface MutableValueGraph<N,V>

Returns:

the value previously associated with the edge connecting nodeU to nodeV, or null if there was no such edge.

removeNode

public boolean removeNode(N node)

Description copied from interface: MutableValueGraph

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

Specified by:

removeNode in interface MutableValueGraph<N,V>

Returns:

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

removeEdge

public V removeEdge(N nodeU,
                    N nodeV)

Description copied from interface: MutableValueGraph

Removes the edge connecting nodeU to nodeV, if it is present.

Specified by:

removeEdge in interface MutableValueGraph<N,V>

Returns:

the value previously associated with the edge connecting nodeU to nodeV, or null if there was no such edge.

newConnections

private GraphConnections<N,V> newConnections()