Class StandardMutableValueGraph<N,V>
- Type Parameters:
N- Node parameter typeV- Value parameter type
- All Implemented Interfaces:
BaseGraph<N>,MutableValueGraph<N,,V> PredecessorsFunction<N>,SuccessorsFunction<N>,ValueGraph<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.
-
Field Summary
FieldsFields inherited from class com.google.common.graph.StandardValueGraph
edgeCount, nodeConnections -
Constructor Summary
ConstructorsConstructorDescriptionStandardMutableValueGraph(AbstractGraphBuilder<? super N> builder) Constructs a mutable graph with the properties specified inbuilder. -
Method Summary
Modifier and TypeMethodDescriptionbooleanAddsnodeif it is not already present.private GraphConnections<N, V> addNodeInternal(N node) Addsnodeto the graph and returns the associatedGraphConnections.Returns anElementOrderthat specifies the order of iteration for the elements ofBaseGraph.edges(),BaseGraph.adjacentNodes(Object),BaseGraph.predecessors(Object),BaseGraph.successors(Object)andBaseGraph.incidentEdges(Object).private GraphConnections<N, V> putEdgeValue(EndpointPair<N> endpoints, V value) Adds an edge connectingendpointsif one is not already present, and sets a value for that edge tovalue(overwriting the existing value, if any).putEdgeValue(N nodeU, N nodeV, V value) Adds an edge connectingnodeUtonodeVif one is not already present, and sets a value for that edge tovalue(overwriting the existing value, if any).removeEdge(EndpointPair<N> endpoints) Removes the edge connectingendpoints, if it is present.removeEdge(N nodeU, N nodeV) Removes the edge connectingnodeUtonodeV, if it is present.booleanremoveNode(N node) Removesnodeif it is present; all edges incident tonodewill also be removed.Methods inherited from class com.google.common.graph.StandardValueGraph
adjacentNodes, allowsSelfLoops, containsNode, edgeCount, edgeValueOrDefault, edgeValueOrDefault, hasEdgeConnecting, hasEdgeConnecting, incidentEdges, isDirected, nodeOrder, nodes, predecessors, successorsMethods inherited from class com.google.common.graph.AbstractValueGraph
asGraph, edgeValue, edgeValue, equals, hashCode, toStringMethods inherited from class com.google.common.graph.AbstractBaseGraph
degree, edges, inDegree, isOrderingCompatible, nodeInvalidatableSet, nodePairInvalidatableSet, outDegree, validateEndpointsMethods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface com.google.common.graph.ValueGraph
adjacentNodes, allowsSelfLoops, asGraph, degree, edges, edgeValue, edgeValue, edgeValueOrDefault, edgeValueOrDefault, equals, hasEdgeConnecting, hasEdgeConnecting, hashCode, incidentEdges, inDegree, isDirected, nodeOrder, nodes, outDegree, predecessors, successors
-
Field Details
-
incidentEdgeOrder
-
-
Constructor Details
-
StandardMutableValueGraph
StandardMutableValueGraph(AbstractGraphBuilder<? super N> builder) Constructs a mutable graph with the properties specified inbuilder.
-
-
Method Details
-
incidentEdgeOrder
Description copied from interface:BaseGraphReturns anElementOrderthat specifies the order of iteration for the elements ofBaseGraph.edges(),BaseGraph.adjacentNodes(Object),BaseGraph.predecessors(Object),BaseGraph.successors(Object)andBaseGraph.incidentEdges(Object).- Specified by:
incidentEdgeOrderin interfaceBaseGraph<N>- Specified by:
incidentEdgeOrderin interfaceValueGraph<N,V> - Overrides:
incidentEdgeOrderin classAbstractBaseGraph<N>
-
addNode
Description copied from interface:MutableValueGraphAddsnodeif it is not already present.Nodes must be unique, just as
Mapkeys must be. They must also be non-null.- Specified by:
addNodein interfaceMutableValueGraph<N,V> - Returns:
trueif the graph was modified as a result of this call
-
addNodeInternal
Addsnodeto the graph and returns the associatedGraphConnections.- Throws:
IllegalStateException- ifnodeis already present
-
putEdgeValue
Description copied from interface:MutableValueGraphAdds an edge connectingnodeUtonodeVif one is not already present, and sets a value for that edge tovalue(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
nodeUandnodeVare not already present in this graph, this method will silentlyaddnodeUandnodeVto the graph.- Specified by:
putEdgeValuein interfaceMutableValueGraph<N,V> - Returns:
- the value previously associated with the edge connecting
nodeUtonodeV, or null if there was no such edge.
-
putEdgeValue
Description copied from interface:MutableValueGraphAdds an edge connectingendpointsif one is not already present, and sets a value for that edge tovalue(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,
endpointsmust 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
addeach missing endpoint to the graph.- Specified by:
putEdgeValuein interfaceMutableValueGraph<N,V> - Returns:
- the value previously associated with the edge connecting
nodeUtonodeV, or null if there was no such edge.
-
removeNode
Description copied from interface:MutableValueGraphRemovesnodeif it is present; all edges incident tonodewill also be removed.- Specified by:
removeNodein interfaceMutableValueGraph<N,V> - Returns:
trueif the graph was modified as a result of this call
-
removeEdge
Description copied from interface:MutableValueGraphRemoves the edge connectingnodeUtonodeV, if it is present.- Specified by:
removeEdgein interfaceMutableValueGraph<N,V> - Returns:
- the value previously associated with the edge connecting
nodeUtonodeV, or null if there was no such edge.
-
removeEdge
Description copied from interface:MutableValueGraphRemoves the edge connectingendpoints, if it is present.If this graph is directed,
endpointsmust be ordered.- Specified by:
removeEdgein interfaceMutableValueGraph<N,V> - Returns:
- the value previously associated with the edge connecting
endpoints, or null if there was no such edge.
-
newConnections
-