OverviewNL-HikingNL-BicycleBE-HikingBE-Bicycle

Node network analysis

Summary:

  • 77.212 km
  • 244 networks
  • 35.702 network nodes
  • 45.612 routes

Situation on:

2017-01-21 22:00

Details:

DetailTotalThe NetherlandsBelgiumExplanation
HikingBicycleHikingBicycle
Length (km)77.21216.92636.8186.31417.152 Total length in kilometers.
Networks244109603243 Number of networks.
Nodes35.70213.82410.8625.4305.586 Number of network nodes.
Routes45.61217.70413.6357.7596.514 Number of routes.
RoutesNotContinious443-536 Number of networks with broken routes.
4024-8390 Number of broken routes.
0,88%0,02%-0,10%5,99% Percentage of broken routes.
RoutesWithIssues1276122638 Number of networks containing routes with issues.
1.8604334900523 Number of routes with issues.
4,08%2,45%0,03%11,60%8,03% Percentage of routes with issues.
IncompleteRoutes1.307376291514

Number of routes that are marked as having an incomplete definition.

A route definition is explicitely marked incomplete by adding a tag fixme with value incomplete in the route relation.

Fixmetodo----- Number of routes that are marked with fixmetodo.
OrphanNodes126--11016

Number of network nodes that do not belong to a network.

The node was not added as a member to a valid network relation, and also not added as a member to valid route relation (that itself was added as a member to a valid network relation or is an orphan route).

OrphanRoutes673183252337

Number of network routes that do not belong to a network.

The route was not added as a member to a valid network relation.

7.575105.2601.1781.124 Total length (km) of the orphan routes (not included in network length above).
IntegrityChecks87314817 Number of networks that include integrity check.
3.4042.0001.358145 Number of nodes with integrity check.
250243-16 Number of failed integrity checks.
92,66%87,85%100,00%-86,67% Integrity check pass rate (percentage of ok checks).
9,53%14,47%12,50%0,02%0,81% Integrity check coverage (percentage of nodes that do have integrity check information).
UnusedSegments785-964 Number of routes where one or more of the ways (or part of ways) are not used in the forward or backward path or in one of the tentacles.
NodesMissing17714210358 Number of routes for which the end node and/or the begin node is not found in any of the ways of the route.
RedundantNodes6349-113 Number of routes where the ways of the route contain extra nodes other than the start and end nodes.
WithoutWays11--- Routes without ways (a route is expected to have at least 1 way).
RouteNameMissing6--51 Routes without a "note" tag with the route name.
RouteTagMissing----- The route relation does not contain a "route" tag.
RouteTagInvalid----- The value in the "route" tag in the route relation is unexpected.
RouteUnexpectedNode44--- Number of routes with one or more unexpected node members. In route relations we expect only nodes with tag "rwn_ref" or "rcn_ref".
RouteUnexpectedRelation----- Number of routes with one or more unexpected members. In route relations we expect only members of type "way", or members of type "node" with a tag "rwn_ref" or "rcn_ref".
ExtraNodes413-731 Number of network relation members of type "node" that are unexpected (expect only network nodes or information maps as members in the network relation).
ExtraWays17--134 Number of network relation members of type "way" (expect only route relations or network nodes as members in the node network relation).
ExtraRelations6--24 Number of network relation members of type "relation" that are unexpected (expect only valid route relations or network nodes as members in the node network relation).
NetworkNameMissing----- Number of networks without "name" tag in the network relation.
Informational:
routesUnaccessible141-49 Number of unaccessible routes.
InvalidSortingOrder333--23310 Number of routes with ways in wrong sorting order.
ReversedRoutes522--96426 Number of routes where the ways are in reverse order (from high node number to low node number).
NodeNameMismatch261-1125135 Routes where the route name does not match with the names of the start node and the end node. The route name is expected to contain the start node name and the end node name, separated by a dash. The start node is expected to have a lower number than the end node.