Consider only the largest connected component

[blahami2]

component := 1
foreach node u where u.visited = false
    foreach node n in DFS(u)
         n.visited = true
         n.component := component
    component := component + 1
max_component = component_map.getall.max(::Size)
foreach node u where u.component != max_component
    remove u from graph
    remove u.edges from graph

• Dijkstra and its result - non-existing path due to turn-restrictions?

[blahami2]

Use

GraphDataUpdater dataUpdater = new SqliteGraphDataUpdater( properties );
GraphDeleteMessenger isolatedAreas = new GraphComponentSearcher().findAllButLargest( graph );
dataUpdater.deleteIsolatedAreas( isolatedAreas );