1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/*
* Copyright (C) 2016 The Guava Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.common.graph;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.graph.GraphConstants.DEFAULT_NODE_COUNT;
import static com.google.common.graph.Graphs.checkNonNegative;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;
import org.checkerframework.checker.nullness.qual.Nullable;
/**
* Configurable implementation of {@link ValueGraph} that supports the options supplied by {@link
* AbstractGraphBuilder}.
*
* <p>This class maintains a map of nodes to {@link GraphConnections}.
*
* <p>Collection-returning accessors return unmodifiable views: the view returned will reflect
* changes to the graph (if the graph is mutable) but may not be modified by the user.
*
* <p>The time complexity of all collection-returning accessors is O(1), since views are returned.
*
* @author James Sexton
* @author Joshua O'Madadhain
* @author Omar Darwish
* @param <N> Node parameter type
* @param <V> Value parameter type
*/
class ConfigurableValueGraph<N, V> extends AbstractValueGraph<N, V> {
private final boolean isDirected;
private final boolean allowsSelfLoops;
private final ElementOrder<N> nodeOrder;
protected final MapIteratorCache<N, GraphConnections<N, V>> nodeConnections;
protected long edgeCount; // must be updated when edges are added or removed
/** Constructs a graph with the properties specified in {@code builder}. */
ConfigurableValueGraph(AbstractGraphBuilder<? super N> builder) {
this(
builder,
builder.nodeOrder.<N, GraphConnections<N, V>>createMap(
builder.expectedNodeCount.or(DEFAULT_NODE_COUNT)),
0L);
}
/**
* Constructs a graph with the properties specified in {@code builder}, initialized with the given
* node map.
*/
ConfigurableValueGraph(
AbstractGraphBuilder<? super N> builder,
Map<N, GraphConnections<N, V>> nodeConnections,
long edgeCount) {
this.isDirected = builder.directed;
this.allowsSelfLoops = builder.allowsSelfLoops;
this.nodeOrder = builder.nodeOrder.cast();
// Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive.
this.nodeConnections =
(nodeConnections instanceof TreeMap)
? new MapRetrievalCache<N, GraphConnections<N, V>>(nodeConnections)
: new MapIteratorCache<N, GraphConnections<N, V>>(nodeConnections);
this.edgeCount = checkNonNegative(edgeCount);
}
@Override
public Set<N> nodes() {
return nodeConnections.unmodifiableKeySet();
}
@Override
public boolean isDirected() {
return isDirected;
}
@Override
public boolean allowsSelfLoops() {
return allowsSelfLoops;
}
@Override
public ElementOrder<N> nodeOrder() {
return nodeOrder;
}
@Override
public Set<N> adjacentNodes(N node) {
return checkedConnections(node).adjacentNodes();
}
@Override
public Set<N> predecessors(N node) {
return checkedConnections(node).predecessors();
}
@Override
public Set<N> successors(N node) {
return checkedConnections(node).successors();
}
@Override
public boolean hasEdgeConnecting(N nodeU, N nodeV) {
return hasEdgeConnecting_internal(checkNotNull(nodeU), checkNotNull(nodeV));
}
@Override
public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
checkNotNull(endpoints);
return isOrderingCompatible(endpoints)
&& hasEdgeConnecting_internal(endpoints.nodeU(), endpoints.nodeV());
}
@Override
public @Nullable V edgeValueOrDefault(N nodeU, N nodeV, @Nullable V defaultValue) {
return edgeValueOrDefault_internal(checkNotNull(nodeU), checkNotNull(nodeV), defaultValue);
}
@Override
public @Nullable V edgeValueOrDefault(EndpointPair<N> endpoints, @Nullable V defaultValue) {
validateEndpoints(endpoints);
return edgeValueOrDefault_internal(endpoints.nodeU(), endpoints.nodeV(), defaultValue);
}
@Override
protected long edgeCount() {
return edgeCount;
}
protected final GraphConnections<N, V> checkedConnections(N node) {
GraphConnections<N, V> connections = nodeConnections.get(node);
if (connections == null) {
checkNotNull(node);
throw new IllegalArgumentException("Node " + node + " is not an element of this graph.");
}
return connections;
}
protected final boolean containsNode(@Nullable N node) {
return nodeConnections.containsKey(node);
}
protected final boolean hasEdgeConnecting_internal(N nodeU, N nodeV) {
GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU);
return (connectionsU != null) && connectionsU.successors().contains(nodeV);
}
protected final V edgeValueOrDefault_internal(N nodeU, N nodeV, V defaultValue) {
GraphConnections<N, V> connectionsU = nodeConnections.get(nodeU);
V value = (connectionsU == null) ? null : connectionsU.value(nodeV);
return value == null ? defaultValue : value;
}
}
|
