25 lines
654 B
C++
25 lines
654 B
C++
#include "extractor/name_table.hpp"
|
|
|
|
#include "util/typedefs.hpp"
|
|
|
|
#include <unordered_set>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace extractor
|
|
{
|
|
class NodeBasedGraphFactory;
|
|
}
|
|
|
|
namespace guidance
|
|
{
|
|
// Find all "segregated" edges, e.g. edges that can be skipped in turn instructions.
|
|
// The main cases are:
|
|
// - middle edges between two osm ways in one logic road (U-turn)
|
|
// - staggered intersections (X-cross)
|
|
// - square/circle intersections
|
|
std::unordered_set<EdgeID> findSegregatedNodes(const extractor::NodeBasedGraphFactory &factory,
|
|
const extractor::NameTable &names);
|
|
} // namespace guidance
|
|
} // namespace osrm
|