/
IsochroneTest.java
86 lines (70 loc) · 3.28 KB
/
IsochroneTest.java
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
package com.graphhopper.isochrone.algorithm;
import com.graphhopper.routing.util.EncodingManager;
import com.graphhopper.routing.util.FlagEncoder;
import com.graphhopper.routing.weighting.FastestWeighting;
import com.graphhopper.routing.weighting.Weighting;
import com.graphhopper.storage.Graph;
import com.graphhopper.storage.GraphExtension;
import com.graphhopper.storage.GraphHopperStorage;
import com.graphhopper.storage.RAMDirectory;
import com.graphhopper.util.PMap;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
import java.util.Collections;
import java.util.List;
import java.util.Set;
import static org.junit.Assert.assertEquals;
/**
* @author Peter Karich
*/
public class IsochroneTest {
private final EncodingManager encodingManager = new EncodingManager("car");
private final FlagEncoder carEncoder = encodingManager.getEncoder("car");
private GraphHopperStorage graph;
@Before
public void setUp() {
graph = new GraphHopperStorage(Collections.<Weighting>emptyList(),
new RAMDirectory(), encodingManager, false, new GraphExtension.NoOpExtension());
graph.create(1000);
}
@After
public void tearDown() {
graph.close();
}
// 0-1-2-3
// |/|/ /|
// 4-5-- |
// |/ \--7
// 6----/
private void initDirectedAndDiffSpeed(Graph graph) {
graph.edge(0, 1).setDistance(70).setFlags(carEncoder.setProperties(10, true, false));
graph.edge(0, 4).setDistance(50).setFlags(carEncoder.setProperties(20, true, false));
graph.edge(1, 4).setDistance(70).setFlags(carEncoder.setProperties(10, true, true));
graph.edge(1, 5).setDistance(70).setFlags(carEncoder.setProperties(10, true, true));
graph.edge(1, 2).setDistance(200).setFlags(carEncoder.setProperties(10, true, true));
graph.edge(5, 2).setDistance(50).setFlags(carEncoder.setProperties(10, true, false));
graph.edge(2, 3).setDistance(50).setFlags(carEncoder.setProperties(10, true, false));
graph.edge(5, 3).setDistance(110).setFlags(carEncoder.setProperties(20, true, false));
graph.edge(3, 7).setDistance(70).setFlags(carEncoder.setProperties(10, true, false));
graph.edge(4, 6).setDistance(50).setFlags(carEncoder.setProperties(20, true, false));
graph.edge(5, 4).setDistance(70).setFlags(carEncoder.setProperties(10, true, false));
graph.edge(5, 6).setDistance(70).setFlags(carEncoder.setProperties(10, true, false));
graph.edge(7, 5).setDistance(50).setFlags(carEncoder.setProperties(20, true, false));
graph.edge(6, 7).setDistance(50).setFlags(carEncoder.setProperties(20, true, true));
}
@Test
public void testSearch() {
initDirectedAndDiffSpeed(graph);
PMap pMap = new PMap();
Isochrone instance = new Isochrone(graph, new FastestWeighting(carEncoder, pMap), false);
// limit to certain seconds
instance.setTimeLimit(60);
List<Set<Integer>> res = instance.search(0, 5);
assertEquals("[[0, 4], [6], [1, 7], [5], [2, 3]]", res.toString());
instance = new Isochrone(graph, new FastestWeighting(carEncoder, pMap), false);
instance.setTimeLimit(30);
res = instance.search(0, 5);
assertEquals("[[0], [4], [], [6], [1, 7]]", res.toString());
}
}