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
|
/*
* 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 java.util.Objects.requireNonNull;
import com.google.common.annotations.Beta;
import com.google.common.collect.Maps;
import java.util.Map;
import java.util.Set;
import javax.annotation.CheckForNull;
/**
* This class provides a skeletal implementation of {@link ValueGraph}. It is recommended to extend
* this class rather than implement {@link ValueGraph} directly.
*
* <p>The methods implemented in this class should not be overridden unless the subclass admits a
* more efficient implementation.
*
* @author James Sexton
* @param <N> Node parameter type
* @param <V> Value parameter type
* @since 20.0
*/
@Beta
@ElementTypesAreNonnullByDefault
public abstract class AbstractValueGraph<N, V> extends AbstractBaseGraph<N>
implements ValueGraph<N, V> {
@Override
public Graph<N> asGraph() {
return new AbstractGraph<N>() {
@Override
public Set<N> nodes() {
return AbstractValueGraph.this.nodes();
}
@Override
public Set<EndpointPair<N>> edges() {
return AbstractValueGraph.this.edges();
}
@Override
public boolean isDirected() {
return AbstractValueGraph.this.isDirected();
}
@Override
public boolean allowsSelfLoops() {
return AbstractValueGraph.this.allowsSelfLoops();
}
@Override
public ElementOrder<N> nodeOrder() {
return AbstractValueGraph.this.nodeOrder();
}
@Override
public ElementOrder<N> incidentEdgeOrder() {
return AbstractValueGraph.this.incidentEdgeOrder();
}
@Override
public Set<N> adjacentNodes(N node) {
return AbstractValueGraph.this.adjacentNodes(node);
}
@Override
public Set<N> predecessors(N node) {
return AbstractValueGraph.this.predecessors(node);
}
@Override
public Set<N> successors(N node) {
return AbstractValueGraph.this.successors(node);
}
@Override
public int degree(N node) {
return AbstractValueGraph.this.degree(node);
}
@Override
public int inDegree(N node) {
return AbstractValueGraph.this.inDegree(node);
}
@Override
public int outDegree(N node) {
return AbstractValueGraph.this.outDegree(node);
}
};
}
@Override
public final boolean equals(@CheckForNull Object obj) {
if (obj == this) {
return true;
}
if (!(obj instanceof ValueGraph)) {
return false;
}
ValueGraph<?, ?> other = (ValueGraph<?, ?>) obj;
return isDirected() == other.isDirected()
&& nodes().equals(other.nodes())
&& edgeValueMap(this).equals(edgeValueMap(other));
}
@Override
public final int hashCode() {
return edgeValueMap(this).hashCode();
}
/** Returns a string representation of this graph. */
@Override
public String toString() {
return "isDirected: "
+ isDirected()
+ ", allowsSelfLoops: "
+ allowsSelfLoops()
+ ", nodes: "
+ nodes()
+ ", edges: "
+ edgeValueMap(this);
}
private static <N, V> Map<EndpointPair<N>, V> edgeValueMap(final ValueGraph<N, V> graph) {
return Maps.asMap(
graph.edges(),
edge ->
// requireNonNull is safe because the endpoint pair comes from the graph.
requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null)));
}
}
|
