57c6c6e51c
This commit removes all occurences of unconnected boundary nodes and switches to the simple heuristic of picking U for the forward and V for the backward node. This performs better than several fancy heuristics.
22 lines
434 B
C++
22 lines
434 B
C++
#ifndef OSRM_EXTRACTOR_NBG_TO_EBG_HPP
|
|
#define OSRM_EXTRACTOR_NBG_TO_EBG_HPP
|
|
|
|
#include "util/typedefs.hpp"
|
|
|
|
namespace osrm
|
|
{
|
|
namespace extractor
|
|
{
|
|
|
|
// Mapping betweenn the node based graph u,v nodes and the edge based graph head,tail edge ids.
|
|
// Required in the osrm-partition tool to translate from a nbg partition to a ebg partition.
|
|
struct NBGToEBG
|
|
{
|
|
NodeID u, v;
|
|
NodeID forward_ebg_node, backward_ebg_node;
|
|
};
|
|
}
|
|
}
|
|
|
|
#endif
|