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
128
129
130
131
132
133
134
|
#include "osrm_engine.hpp"
#include "osrm2feature_map.hpp"
#include "base/logging.hpp"
#include "base/timer.hpp"
#include "3party/osrm/osrm-backend/data_structures/internal_route_result.hpp"
#include "3party/osrm/osrm-backend/data_structures/search_engine_data.hpp"
#include "3party/osrm/osrm-backend/routing_algorithms/n_to_m_many_to_many.hpp"
#include "3party/osrm/osrm-backend/routing_algorithms/shortest_path.hpp"
namespace routing
{
bool IsRouteExist(InternalRouteResult const & r)
{
return !(INVALID_EDGE_WEIGHT == r.shortest_path_length || r.segment_end_coordinates.empty() ||
r.source_traversed_in_reverse.empty());
}
void GenerateRoutingTaskFromNodeId(NodeID const nodeId, bool const isStartNode,
PhantomNode & taskNode)
{
taskNode.forward_node_id = isStartNode ? nodeId : INVALID_NODE_ID;
taskNode.reverse_node_id = isStartNode ? INVALID_NODE_ID : nodeId;
taskNode.forward_weight = 0;
taskNode.reverse_weight = 0;
taskNode.forward_offset = 0;
taskNode.reverse_offset = 0;
taskNode.name_id = 1;
}
void FindWeightsMatrix(TRoutingNodes const & sources, TRoutingNodes const & targets,
TRawDataFacade & facade, vector<EdgeWeight> & result)
{
SearchEngineData engineData;
NMManyToManyRouting<TRawDataFacade> pathFinder(&facade, engineData);
PhantomNodeArray sourcesTaskVector(sources.size());
PhantomNodeArray targetsTaskVector(targets.size());
for (size_t i = 0; i < sources.size(); ++i)
sourcesTaskVector[i].push_back(sources[i].node);
for (size_t i = 0; i < targets.size(); ++i)
targetsTaskVector[i].push_back(targets[i].node);
// Calculate time consumption of a NtoM path finding.
my::HighResTimer timer(true);
shared_ptr<vector<EdgeWeight>> resultTable = pathFinder(sourcesTaskVector, targetsTaskVector);
LOG(LINFO, ("Duration of a single one-to-many routing call", timer.ElapsedNano(), "ns"));
timer.Reset();
ASSERT_EQUAL(resultTable->size(), sources.size() * targets.size(), ());
result.swap(*resultTable);
}
bool FindSingleRoute(FeatureGraphNode const & source, FeatureGraphNode const & target,
TRawDataFacade & facade, RawRoutingResult & rawRoutingResult)
{
SearchEngineData engineData;
InternalRouteResult result;
ShortestPathRouting<TRawDataFacade> pathFinder(&facade, engineData);
PhantomNodes nodes;
nodes.source_phantom = source.node;
nodes.target_phantom = target.node;
if ((nodes.source_phantom.forward_node_id != INVALID_NODE_ID ||
nodes.source_phantom.reverse_node_id != INVALID_NODE_ID) &&
(nodes.target_phantom.forward_node_id != INVALID_NODE_ID ||
nodes.target_phantom.reverse_node_id != INVALID_NODE_ID))
{
result.segment_end_coordinates.push_back(nodes);
pathFinder({nodes}, {}, result);
}
if (IsRouteExist(result))
{
rawRoutingResult.sourceEdge = source;
rawRoutingResult.targetEdge = target;
rawRoutingResult.shortestPathLength = result.shortest_path_length;
for (auto const & path : result.unpacked_path_segments)
{
vector<RawPathData> data;
data.reserve(path.size());
for (auto const & element : path)
{
data.emplace_back(element.node, element.segment_duration);
}
rawRoutingResult.unpackedPathSegments.emplace_back(move(data));
}
return true;
}
return false;
}
FeatureGraphNode::FeatureGraphNode(NodeID const nodeId, bool const isStartNode,
Index::MwmId const & id)
: segmentPoint(m2::PointD::Zero()), mwmId(id)
{
node.forward_node_id = isStartNode ? nodeId : INVALID_NODE_ID;
node.reverse_node_id = isStartNode ? INVALID_NODE_ID : nodeId;
node.forward_weight = 0;
node.reverse_weight = 0;
node.forward_offset = 0;
node.reverse_offset = 0;
node.name_id = 1;
segment.m_fid = kInvalidFid;
}
FeatureGraphNode::FeatureGraphNode(NodeID const nodeId, NodeID const reverseNodeId,
bool const isStartNode, Index::MwmId const & id)
: segmentPoint(m2::PointD::Zero()), mwmId(id)
{
node.forward_node_id = isStartNode ? nodeId : reverseNodeId;
node.reverse_node_id = isStartNode ? reverseNodeId : nodeId;
node.forward_weight = 0;
node.reverse_weight = 0;
node.forward_offset = 0;
node.reverse_offset = 0;
node.name_id = 1;
segment.m_fid = kInvalidFid;
}
FeatureGraphNode::FeatureGraphNode()
{
node.forward_node_id = INVALID_NODE_ID;
node.reverse_node_id = INVALID_NODE_ID;
node.forward_weight = 0;
node.reverse_weight = 0;
node.forward_offset = 0;
node.reverse_offset = 0;
node.name_id = 1;
segment.m_fid = kInvalidFid;
segmentPoint = m2::PointD::Zero();
}
} // namespace routing
|
