Fixed segregated identification code to not mark circular
edges as segregated
This commit is contained in:
parent
b56a7579a8
commit
535bb49893
@ -118,8 +118,8 @@ std::unordered_set<EdgeID> findSegregatedNodes(const extractor::NodeBasedGraphFa
|
|||||||
// Also they must be a road use (not footway, cycleway, etc.)
|
// Also they must be a road use (not footway, cycleway, etc.)
|
||||||
// TODO - consider whether alleys, cul-de-sacs, and other road uses
|
// TODO - consider whether alleys, cul-de-sacs, and other road uses
|
||||||
// are candidates to be marked as internal intersection edges.
|
// are candidates to be marked as internal intersection edges.
|
||||||
// TODO adjust length as needed with lamda
|
// TODO adjust length as needed with lambda
|
||||||
if (edge_length > INTERNAL_LENGTH_MAX || current.flags.roundabout)
|
if (edge_length > INTERNAL_LENGTH_MAX || current.flags.roundabout || current.flags.circular)
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user