Abstract: Aspects concern a method for correcting errors in map data comprising obtaining map data specifying travel possibilities between locations, generating a routing graph from the map data by assigning a vertex to each location and an edge from one vertex to another vertex if the map data specifies that it is possible to travel from the location to which the first vertex is assigned to the location to which the second vertex is assigned, identifying the largest strongly connected component of the routing graph, identifying one or more further strongly connected components of the routing graph, detecting errors in the map data by identifying travel possibilities that are not in the map data which lead to missing connections between the one or more further strongly connected components of the routing graph and the largest strongly connected component of the routing graph and amending the map data by the identified travel possibilities.

Abstract: Aspects concern a method for correcting errors in map data comprising obtaining map data specifying travel possibilities between locations, generating a routing graph from the map data by assigning a vertex to each location and an edge from one vertex to another vertex if the map data specifies that it is possible to travel from the location to which the first vertex is assigned to the location to which the second vertex is assigned, identifying the largest strongly connected component of the routing graph, identifying one or more further strongly connected components of the routing graph, detecting errors in the map data by identifying travel possibilities that are not in the map data which lead to missing connections between the one or more further strongly connected components of the routing graph and the largest strongly connected component of the routing graph and amending the map data by the identified travel possibilities.

Abstract: Aspects concern a method for correcting errors in map data comprising obtaining map data specifying travel possibilities between locations, generating a routing graph from the map data by assigning a vertex to each location and an edge from one vertex to another vertex if the map data specifies that it is possible to travel from the location to which the first vertex is assigned to the location to which the second vertex is assigned, identifying the largest strongly connected component of the routing graph, identifying one or more further strongly connected components of the routing graph, detecting errors in the map data by identifying travel possibilities that are not in the map data which lead to missing connections between the one or more further strongly connected components of the routing graph and the largest strongly connected component of the routing graph and amending the map data by the identified travel possibilities.