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
|
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 org.apache.tuscany.sca.databinding.impl;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
import java.util.Arrays;
import java.util.List;
import org.apache.tuscany.sca.databinding.impl.DirectedGraph.Edge;
import org.apache.tuscany.sca.databinding.impl.DirectedGraph.Vertex;
import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;
/**
*
* @version $Rev$ $Date$
*/
public class DirectedGraphTestCase {
private DirectedGraph<String, Object> graph;
@Before
public void setUp() throws Exception {
graph = new DirectedGraph<String, Object>();
}
@Test
public void testGraph() {
graph.addEdge("a", "b", null, 4, true);
graph.addEdge("a", "b", null, 5, true);
Assert.assertEquals(4, graph.getEdge("a", "b").getWeight());
graph.addEdge("a", "b", null, 3, true);
Assert.assertEquals(3, graph.getEdge("a", "b").getWeight());
graph.addEdge("b", "c", null, 1, true);
// graph.addEdge("a", "c", null, 8, true);
graph.addEdge("a", "d", null, 3, true);
graph.addEdge("b", "d", null, 2, true);
graph.addEdge("d", "c", null, 3, true);
graph.addEdge("c", "b", null, 1, true);
graph.addEdge("c", "d", null, 2, true);
graph.addEdge("d", "b", null, 1, true);
graph.addEdge("a", "e", null, 8, true);
graph.addEdge("c", "c", null, 2, true);
graph.addEdge("f", "g", null, 2, false);
graph.addEdge("f", "h", null, 8, true);
graph.addEdge("g", "j", null, 2, false);
graph.addEdge("j", "i", null, 2, true);
graph.addEdge("h", "i", null, 8, true);
Vertex vertex = graph.getVertex("a");
Assert.assertNotNull(vertex);
Assert.assertEquals(vertex.getValue(), "a");
Assert.assertNull(graph.getVertex("1"));
Edge edge = graph.getEdge("a", "b");
Assert.assertNotNull(edge);
Assert.assertEquals(edge.getWeight(), 3);
edge = graph.getEdge("b", "a");
Assert.assertNull(edge);
DirectedGraph<String, Object>.Path path = graph.getShortestPath("a", "c");
List<DirectedGraph<String, Object>.Edge> edges = path.getEdges();
Assert.assertEquals(edges.size(), 2);
Assert.assertEquals(edges.get(0), graph.getEdge("a", "b"));
Assert.assertEquals(edges.get(1), graph.getEdge("b", "c"));
Assert.assertEquals(path.getWeight(), 4);
DirectedGraph<String, Object>.Path path2 = graph.getShortestPath("b", "e");
Assert.assertNull(path2);
DirectedGraph<String, Object>.Path path3 = graph.getShortestPath("a", "a");
Assert.assertTrue(path3.getWeight() == 0 && path3.getEdges().isEmpty());
DirectedGraph<String, Object>.Path path4 = graph.getShortestPath("c", "c");
Assert.assertTrue(path4.getWeight() == 2 && path4.getEdges().size() == 1);
DirectedGraph<String, Object>.Path path5 = graph.getShortestPath("f", "i");
Assert.assertTrue(path5.getWeight() == 16 && path5.getEdges().size() == 2);
}
@Test
public void testSort() {
graph.addEdge("a", "b");
graph.addEdge("a", "c");
graph.addEdge("c", "d");
graph.addEdge("b", "c");
List<String> order = graph.topologicalSort(true);
assertEquals(Arrays.asList("a", "b", "c", "d"), order);
assertTrue(!graph.getVertices().isEmpty());
graph.addEdge("d", "a");
try {
order = graph.topologicalSort(true);
assertTrue("Should have failed", false);
} catch (IllegalArgumentException e) {
assertTrue(true);
}
graph.removeEdge("d", "a");
order = graph.topologicalSort(false);
assertEquals(Arrays.asList("a", "b", "c", "d"), order);
assertTrue(graph.getVertices().isEmpty());
}
}
|
