655ca803d8
This graph enables efficient boundary edge scans at each level. Currenly this needs about |V|*|L| bytes of storage. We can optimize this when the highest boundary nodes ID is << |V|.
41 lines
999 B
C++
41 lines
999 B
C++
#ifndef OSRM_CUSTOMIZE_EDGE_BASED_GRAPH_HPP
|
|
#define OSRM_CUSTOMIZE_EDGE_BASED_GRAPH_HPP
|
|
|
|
#include "extractor/edge_based_edge.hpp"
|
|
#include "partition/edge_based_graph.hpp"
|
|
#include "partition/multi_level_graph.hpp"
|
|
#include "util/static_graph.hpp"
|
|
#include "util/typedefs.hpp"
|
|
|
|
#include <boost/filesystem/path.hpp>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace customizer
|
|
{
|
|
|
|
using EdgeBasedGraphEdgeData = partition::EdgeBasedGraphEdgeData;
|
|
|
|
struct MultiLevelEdgeBasedGraph : public partition::MultiLevelGraph<EdgeBasedGraphEdgeData, false>
|
|
{
|
|
using Base = partition::MultiLevelGraph<EdgeBasedGraphEdgeData, false>;
|
|
using Base::Base;
|
|
};
|
|
|
|
struct MultiLevelEdgeBasedGraphView
|
|
: public partition::MultiLevelGraph<EdgeBasedGraphEdgeData, true>
|
|
{
|
|
using Base = partition::MultiLevelGraph<EdgeBasedGraphEdgeData, true>;
|
|
using Base::Base;
|
|
};
|
|
|
|
struct StaticEdgeBasedGraphEdge : MultiLevelEdgeBasedGraph::InputEdge
|
|
{
|
|
using Base = MultiLevelEdgeBasedGraph::InputEdge;
|
|
using Base::Base;
|
|
};
|
|
}
|
|
}
|
|
|
|
#endif
|