/
Path4CH.java
106 lines (92 loc) · 3.73 KB
/
Path4CH.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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
/*
* Licensed to GraphHopper and Peter Karich under one or more contributor
* license agreements. See the NOTICE file distributed with this work for
* additional information regarding copyright ownership.
*
* GraphHopper 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 com.graphhopper.routing.ch;
import com.graphhopper.routing.PathBidirRef;
import com.graphhopper.routing.util.FlagEncoder;
import com.graphhopper.storage.Graph;
import com.graphhopper.util.EdgeSkipIterState;
/**
* Recursivly unpack shortcuts.
* <p/>
* @see PrepareContractionHierarchies
* @author Peter Karich
*/
public class Path4CH extends PathBidirRef
{
private final Graph routingGraph;
public Path4CH( Graph routingGraph, Graph baseGraph, FlagEncoder encoder )
{
super(baseGraph, encoder);
this.routingGraph = routingGraph;
}
@Override
protected final void processEdge( int tmpEdge, int endNode )
{
// Shortcuts do only contain valid weight so first expand before adding
// to distance and time
expandEdge((EdgeSkipIterState) routingGraph.getEdgeProps(tmpEdge, endNode), false);
}
private void expandEdge( EdgeSkipIterState mainEdgeState, boolean reverse )
{
if (!mainEdgeState.isShortcut())
{
double dist = mainEdgeState.getDistance();
distance += dist;
long flags = mainEdgeState.getFlags();
millis += calcMillis(dist, flags, reverse);
addEdge(mainEdgeState.getEdge());
return;
}
int skippedEdge1 = mainEdgeState.getSkippedEdge1();
int skippedEdge2 = mainEdgeState.getSkippedEdge2();
int from = mainEdgeState.getBaseNode(), to = mainEdgeState.getAdjNode();
// get properties like speed of the edge in the correct direction
if (reverse)
{
int tmp = from;
from = to;
to = tmp;
}
// getEdgeProps could possibly return an empty edge if the shortcut is available for both directions
if (reverseOrder)
{
EdgeSkipIterState edgeState = (EdgeSkipIterState) routingGraph.getEdgeProps(skippedEdge1, to);
boolean empty = edgeState == null;
if (empty)
edgeState = (EdgeSkipIterState) routingGraph.getEdgeProps(skippedEdge2, to);
expandEdge(edgeState, false);
if (empty)
edgeState = (EdgeSkipIterState) routingGraph.getEdgeProps(skippedEdge1, from);
else
edgeState = (EdgeSkipIterState) routingGraph.getEdgeProps(skippedEdge2, from);
expandEdge(edgeState, true);
} else
{
EdgeSkipIterState iter = (EdgeSkipIterState) routingGraph.getEdgeProps(skippedEdge1, from);
boolean empty = iter == null;
if (empty)
iter = (EdgeSkipIterState) routingGraph.getEdgeProps(skippedEdge2, from);
expandEdge(iter, true);
if (empty)
iter = (EdgeSkipIterState) routingGraph.getEdgeProps(skippedEdge1, to);
else
iter = (EdgeSkipIterState) routingGraph.getEdgeProps(skippedEdge2, to);
expandEdge(iter, false);
}
}
}