226ee62981
move to a dedicated dijkstra, separate code and header reduce heap size, we don't use more than 2000 nodes, so why allocate 170k?
45 lines
1.2 KiB
C++
45 lines
1.2 KiB
C++
#ifndef OSRM_CONTRACTOR_CONTRACTOR_GRAPH_HPP_
|
|
#define OSRM_CONTRACTOR_CONTRACTOR_GRAPH_HPP_
|
|
|
|
#include "util/dynamic_graph.hpp"
|
|
#include <algorithm>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace contractor
|
|
{
|
|
|
|
struct ContractorEdgeData
|
|
{
|
|
ContractorEdgeData()
|
|
: weight(0), id(0), originalEdges(0), shortcut(0), forward(0), backward(0),
|
|
is_original_via_node_ID(false)
|
|
{
|
|
}
|
|
ContractorEdgeData(unsigned weight,
|
|
unsigned original_edges,
|
|
unsigned id,
|
|
bool shortcut,
|
|
bool forward,
|
|
bool backward)
|
|
: weight(weight), id(id), originalEdges(std::min((unsigned)1 << 28, original_edges)),
|
|
shortcut(shortcut), forward(forward), backward(backward), is_original_via_node_ID(false)
|
|
{
|
|
}
|
|
unsigned weight;
|
|
unsigned id;
|
|
unsigned originalEdges : 28;
|
|
bool shortcut : 1;
|
|
bool forward : 1;
|
|
bool backward : 1;
|
|
bool is_original_via_node_ID : 1;
|
|
};
|
|
|
|
using ContractorGraph = util::DynamicGraph<ContractorEdgeData>;
|
|
using ContractorEdge = ContractorGraph::InputEdge;
|
|
|
|
} // namespace contractor
|
|
} // namespace osrm
|
|
|
|
#endif // OSRM_CONTRACTOR_CONTRACTOR_GRAPH_HPP_
|