OverviewNL-HikingNL-BicycleBE-HikingBE-Bicycle

Node network analysis

Summary:

  • 84.300 km
  • 260 networks
  • 40.600 network nodes
  • 51.583 routes

Situation on:

2017-10-23 22:00

Details:

DetailTotalThe NetherlandsBelgiumExplanation
HikingBicycleHikingBicycle
Length (km)84.30018.97938.0147.60619.699 Total length in kilometers.
Networks260115603946 Number of networks.
Nodes40.60015.54311.9476.5616.549 Number of network nodes.
Routes51.58319.83114.7989.1987.756 Number of routes.
RoutesNotContinious42--2 Number of networks with broken routes.
103--7 Number of broken routes.
0,02%0,02%--0,09% Percentage of broken routes.
RoutesWithIssues1015812517 Number of networks containing routes with issues.
1.320492176760 Number of routes with issues.
2,56%2,48%0,01%8,34%0,77% Percentage of routes with issues.
IncompleteRoutes1.259451276640

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.
OrphanNodes-----

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).

OrphanRoutes854252630

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

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

6.6712475.113870441 Total length (km) of the orphan routes (not included in network length above).
IntegrityChecks108415746 Number of networks that include integrity check.
5.5522.7652.738544 Number of nodes with integrity check.
403399-13 Number of failed integrity checks.
92,74%85,57%100,00%80,00%93,18% Integrity check pass rate (percentage of ok checks).
13,67%17,79%22,92%0,08%0,67% Integrity check coverage (percentage of nodes that do have integrity check information).
UnusedSegments841-3 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.
NodesMissing11--- Number of routes for which the end node and/or the begin node is not found in any of the ways of the route.
RedundantNodes5139-111 Number of routes where the ways of the route contain extra nodes other than the start and end nodes.
WithoutWays----- Routes without ways (a route is expected to have at least 1 way).
RouteNameMissing----- 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.
RouteUnexpectedNode----- 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".
ExtraNodes----- Number of network relation members of type "node" that are unexpected (expect only network nodes or information maps as members in the network relation).
ExtraWays----- Number of network relation members of type "way" (expect only route relations or network nodes as members in the node network relation).
ExtraRelations----- 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:
routesUnaccessible----- Number of unaccessible routes.
InvalidSortingOrder1---1 Number of routes with ways in wrong sorting order.
ReversedRoutes11--- Number of routes where the ways are in reverse order (from high node number to low node number).
NodeNameMismatch----- 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.