2018-02-01 10:47:43 -05:00
|
|
|
#ifndef OSRM_PARTITIONER_BISECTION_TO_PARTITION_HPP
|
|
|
|
#define OSRM_PARTITIONER_BISECTION_TO_PARTITION_HPP
|
2017-03-05 15:31:45 -05:00
|
|
|
|
2018-02-01 10:47:43 -05:00
|
|
|
#include "partitioner/multi_level_partition.hpp"
|
|
|
|
#include "partitioner/recursive_bisection.hpp"
|
2017-03-05 15:31:45 -05:00
|
|
|
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
namespace osrm
|
|
|
|
{
|
2018-02-01 10:47:43 -05:00
|
|
|
namespace partitioner
|
2017-03-05 15:31:45 -05:00
|
|
|
{
|
|
|
|
|
|
|
|
using Partition = std::vector<CellID>;
|
|
|
|
|
|
|
|
// Converts a representation of the bisection to cell ids over multiple level
|
|
|
|
std::tuple<std::vector<Partition>, std::vector<std::uint32_t>>
|
|
|
|
bisectionToPartition(const std::vector<BisectionID> &node_to_bisection_id,
|
|
|
|
const std::vector<std::size_t> &max_cell_sizes);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|