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|.
19 lines
203 B
C++
19 lines
203 B
C++
#ifndef OSRM_CUSTOMIZER_IO_HPP
|
|
#define OSRM_CUSTOMIZER_IO_HPP
|
|
|
|
#include "customizer/edge_based_graph.hpp"
|
|
|
|
#include "storage/io.hpp"
|
|
|
|
namespace osrm
|
|
{
|
|
namespace customizer
|
|
{
|
|
namespace io
|
|
{
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif
|