1 package edu.uci.ics.jung.graph;
2
3 import java.util.HashSet;
4 import java.util.Set;
5
6 import edu.uci.ics.jung.graph.util.EdgeType;
7
8 public class SortedSparseMultigraphTest
9 extends AbstractSortedSparseMultigraphTest {
10
11
12 @Override
13 protected void setUp() throws Exception {
14 super.setUp();
15 Set<Number> seeds = new HashSet<Number>();
16 seeds.add(1);
17 seeds.add(5);
18 graph = new SortedSparseMultigraph<Integer,Double>();
19 graph.addEdge(4., 2, 1);
20 graph.addEdge(5., 3, 1);
21 graph.addEdge(6., 0, 4, EdgeType.DIRECTED);
22 graph.addEdge(7., 0, 5, EdgeType.DIRECTED);
23 graph.addEdge(1., 0, 1);
24 graph.addEdge(2., 1, 2);
25 graph.addEdge(3., 0, 2);
26 graph.addEdge(8., 5, 1, EdgeType.DIRECTED);
27 graph.addEdge(9., 6, 1, EdgeType.DIRECTED);
28 graph.addEdge(10., 4, 3, EdgeType.DIRECTED);
29 graph.addEdge(16., 8, 3);
30 graph.addEdge(17., 5, 7);
31 graph.addEdge(11., 2, 7);
32 graph.addEdge(12., 1, 5);
33 graph.addEdge(13., 2, 6);
34 graph.addEdge(14., 6, 4);
35 graph.addEdge(15., 7, 8);
36
37 smallGraph = new SparseMultigraph<Integer,Double>();
38 smallGraph.addVertex(v0);
39 smallGraph.addVertex(v1);
40 smallGraph.addVertex(v2);
41 smallGraph.addEdge(e01, v0, v1);
42 smallGraph.addEdge(e10, v1, v0);
43 smallGraph.addEdge(e12, v1, v2);
44 smallGraph.addEdge(e21, v2, v1, EdgeType.DIRECTED);
45
46 Graph<Foo,Bar> fooBar = new SortedSparseMultigraph<Foo,Bar>();
47 try {
48 fooBar.addVertex(new Foo());
49 fooBar.addVertex(new Foo());
50 fooBar.addEdge(new Bar(), new Foo(), new Foo());
51 fail("should have thrown an exception as Foo Bar are not Comparable");
52 } catch(Exception ex) {
53
54 }
55
56 }
57 }