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
package edu.caltech.cs2.datastructures;
import edu.caltech.cs2.interfaces.IDictionary;
import edu.caltech.cs2.interfaces.IGraph;
import edu.caltech.cs2.interfaces.ISet;
public class Graph<V, E> implements IGraph<V, E> {
@Override
public boolean addVertex(V vertex) {
return false;
}
@Override
public boolean addEdge(V src, V dest, E e) {
return false;
}
@Override
public boolean addUndirectedEdge(V n1, V n2, E e) {
return false;
}
@Override
public boolean removeEdge(V src, V dest) {
return false;
}
@Override
public ISet<V> vertices() {
return null;
}
@Override
public E adjacent(V i, V j) {
return null;
}
@Override
public ISet<V> neighbors(V vertex) {
return null;
}
}