1 package edu.uci.ics.jung.visualization.spatial;
2
3 import java.util.Collection;
4
5 import edu.uci.ics.jung.graph.Graph;
6 import edu.uci.ics.jung.graph.util.EdgeType;
7 import edu.uci.ics.jung.graph.util.Pair;
8
9 public class AggregateGraph<V, E> implements Graph<V, E> {
10
11
12
13 public boolean addEdge(E e, V v1, V v2) {
14
15 return false;
16 }
17
18
19 public boolean addEdge(E e, V v1, V v2, EdgeType edgeType) {
20
21 return false;
22 }
23
24
25 public V getDest(E directedEdge) {
26
27 return null;
28 }
29
30
31 public Pair<V> getEndpoints(E edge) {
32
33 return null;
34 }
35
36
37 public Collection<E> getInEdges(V vertex) {
38
39 return null;
40 }
41
42
43 public V getOpposite(V vertex, E edge) {
44
45 return null;
46 }
47
48
49 public Collection<E> getOutEdges(V vertex) {
50
51 return null;
52 }
53
54
55 public int getPredecessorCount(V vertex) {
56
57 return 0;
58 }
59
60
61 public Collection<V> getPredecessors(V vertex) {
62
63 return null;
64 }
65
66
67 public V getSource(E directedEdge) {
68
69 return null;
70 }
71
72
73 public int getSuccessorCount(V vertex) {
74
75 return 0;
76 }
77
78
79 public Collection<V> getSuccessors(V vertex) {
80
81 return null;
82 }
83
84
85 public int inDegree(V vertex) {
86
87 return 0;
88 }
89
90
91 public boolean isDest(V vertex, E edge) {
92
93 return false;
94 }
95
96
97 public boolean isPredecessor(V v1, V v2) {
98
99 return false;
100 }
101
102
103 public boolean isSource(V vertex, E edge) {
104
105 return false;
106 }
107
108
109 public boolean isSuccessor(V v1, V v2) {
110
111 return false;
112 }
113
114
115 public int outDegree(V vertex) {
116
117 return 0;
118 }
119
120
121 public boolean addEdge(E edge, Collection<? extends V> vertices) {
122
123 return false;
124 }
125
126
127 public boolean addEdge(E edge, Collection<? extends V> vertices,
128 EdgeType edgeType) {
129
130 return false;
131 }
132
133
134 public boolean addVertex(V vertex) {
135
136 return false;
137 }
138
139
140 public boolean containsEdge(E edge) {
141
142 return false;
143 }
144
145
146 public boolean containsVertex(V vertex) {
147
148 return false;
149 }
150
151
152 public int degree(V vertex) {
153
154 return 0;
155 }
156
157
158 public E findEdge(V v1, V v2) {
159
160 return null;
161 }
162
163
164 public Collection<E> findEdgeSet(V v1, V v2) {
165
166 return null;
167 }
168
169
170 public EdgeType getDefaultEdgeType() {
171
172 return null;
173 }
174
175
176 public int getEdgeCount() {
177
178 return 0;
179 }
180
181
182 public int getEdgeCount(EdgeType edgeType) {
183
184 return 0;
185 }
186
187
188 public EdgeType getEdgeType(E edge) {
189
190 return null;
191 }
192
193
194 public Collection<E> getEdges() {
195
196 return null;
197 }
198
199
200 public Collection<E> getEdges(EdgeType edgeType) {
201
202 return null;
203 }
204
205
206 public int getIncidentCount(E edge) {
207
208 return 0;
209 }
210
211
212 public Collection<E> getIncidentEdges(V vertex) {
213
214 return null;
215 }
216
217
218 public Collection<V> getIncidentVertices(E edge) {
219
220 return null;
221 }
222
223
224 public int getNeighborCount(V vertex) {
225
226 return 0;
227 }
228
229
230 public Collection<V> getNeighbors(V vertex) {
231
232 return null;
233 }
234
235
236 public int getVertexCount() {
237
238 return 0;
239 }
240
241
242 public Collection<V> getVertices() {
243
244 return null;
245 }
246
247
248 public boolean isIncident(V vertex, E edge) {
249
250 return false;
251 }
252
253
254 public boolean isNeighbor(V v1, V v2) {
255
256 return false;
257 }
258
259
260 public boolean removeEdge(E edge) {
261
262 return false;
263 }
264
265
266 public boolean removeVertex(V vertex) {
267
268 return false;
269 }
270
271 }