90 lines
2.3 KiB
C++
90 lines
2.3 KiB
C++
#include "contractor/contractor_search.hpp"
|
|
|
|
#include "contractor/contractor_graph.hpp"
|
|
#include "contractor/contractor_heap.hpp"
|
|
|
|
namespace osrm
|
|
{
|
|
namespace contractor
|
|
{
|
|
|
|
namespace
|
|
{
|
|
void relaxNode(ContractorHeap &heap,
|
|
const ContractorGraph &graph,
|
|
const NodeID node,
|
|
const EdgeWeight node_weight,
|
|
const NodeID forbidden_node)
|
|
{
|
|
const short current_hop = heap.GetData(node).hop + 1;
|
|
for (auto edge : graph.GetAdjacentEdgeRange(node))
|
|
{
|
|
const auto &data = graph.GetEdgeData(edge);
|
|
if (!data.forward)
|
|
{
|
|
continue;
|
|
}
|
|
const NodeID to = graph.GetTarget(edge);
|
|
BOOST_ASSERT(to != SPECIAL_NODEID);
|
|
if (forbidden_node == to)
|
|
{
|
|
continue;
|
|
}
|
|
const EdgeWeight to_weight = node_weight + data.weight;
|
|
|
|
const auto toHeapNode = heap.GetHeapNodeIfWasInserted(to);
|
|
// New Node discovered -> Add to Heap + Node Info Storage
|
|
if (!toHeapNode)
|
|
{
|
|
heap.Insert(to, to_weight, ContractorHeapData{current_hop, false});
|
|
}
|
|
// Found a shorter Path -> Update weight
|
|
else if (to_weight < toHeapNode->weight)
|
|
{
|
|
toHeapNode->weight = to_weight;
|
|
heap.DecreaseKey(*toHeapNode);
|
|
toHeapNode->data.hop = current_hop;
|
|
}
|
|
}
|
|
}
|
|
} // namespace
|
|
|
|
void search(ContractorHeap &heap,
|
|
const ContractorGraph &graph,
|
|
const unsigned number_of_targets,
|
|
const int node_limit,
|
|
const EdgeWeight weight_limit,
|
|
const NodeID forbidden_node)
|
|
{
|
|
int nodes = 0;
|
|
unsigned number_of_targets_found = 0;
|
|
while (!heap.Empty())
|
|
{
|
|
const NodeID node = heap.DeleteMin();
|
|
BOOST_ASSERT(node != SPECIAL_NODEID);
|
|
const auto node_weight = heap.GetKey(node);
|
|
if (++nodes > node_limit)
|
|
{
|
|
return;
|
|
}
|
|
if (node_weight > weight_limit)
|
|
{
|
|
return;
|
|
}
|
|
|
|
// Destination settled?
|
|
if (heap.GetData(node).target)
|
|
{
|
|
++number_of_targets_found;
|
|
if (number_of_targets_found >= number_of_targets)
|
|
{
|
|
return;
|
|
}
|
|
}
|
|
|
|
relaxNode(heap, graph, node, node_weight, forbidden_node);
|
|
}
|
|
}
|
|
} // namespace contractor
|
|
} // namespace osrm
|