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.OrderedSparseMultigraph;
7 import edu.uci.ics.jung.graph.SparseMultigraph;
8 import edu.uci.ics.jung.graph.util.EdgeType;
9
10 public class OrderedSparseMultigraphTest extends AbstractOrderedSparseMultigraphTest {
11
12
13 @Override
14 protected void setUp() throws Exception {
15 super.setUp();
16 Set<Number> seeds = new HashSet<Number>();
17 seeds.add(1);
18 seeds.add(5);
19 graph = new OrderedSparseMultigraph<Number,Number>();
20 graph.addEdge(4, 2, 1);
21 graph.addEdge(5, 3, 1);
22 graph.addEdge(6, 0, 4, EdgeType.DIRECTED);
23 graph.addEdge(7, 0, 5, EdgeType.DIRECTED);
24 graph.addEdge(1, 0, 1);
25 graph.addEdge(2, 1, 2);
26 graph.addEdge(3, 0, 2);
27 graph.addEdge(8, 5, 1, EdgeType.DIRECTED);
28 graph.addEdge(9, 6, 1, EdgeType.DIRECTED);
29 graph.addEdge(10, 4, 3, EdgeType.DIRECTED);
30 graph.addEdge(16, 8, 3);
31 graph.addEdge(17, 5, 7);
32 graph.addEdge(11, 2, 7);
33 graph.addEdge(12, 1, 5);
34 graph.addEdge(13, 2, 6);
35 graph.addEdge(14, 6, 4);
36 graph.addEdge(15, 7, 8);
37
38 smallGraph = new SparseMultigraph<Integer,Number>();
39 smallGraph.addVertex(v0);
40 smallGraph.addVertex(v1);
41 smallGraph.addVertex(v2);
42 smallGraph.addEdge(e01, v0, v1);
43 smallGraph.addEdge(e10, v1, v0);
44 smallGraph.addEdge(e12, v1, v2);
45 smallGraph.addEdge(e21, v2, v1, EdgeType.DIRECTED);
46
47 }
48
49 }