[Routing] How to handle lack of connectivity within the routing graph?

[David MENTRE]

Hello Frederik,

Frederik Ramm <frederik at remote.org> writes:

> A very long time ago I ran an analysis on the whole of Europe and found 
> it to consist of (only) three large non-connected parts. However I 
> looked at *any* way, not just what I considered to be roads.

Yes, that's the trick: some ways have other attributes than those
documented on the wiki. :-/

> See http://tagwatch.openstreetmap.fr/france/en_stats_highway.htm for a 
> list of things used. Try running your program and have it work on 
> anything tagged highway=... - does that change things?

Yes. I now have one big strongly connected component and two minor ones:

* Connected components
 Number of ways: 954
 Number of connected components: 3
  color 0: 952 ways
  color 1: 1 ways
  color 2: 1 ways

Now, my routing algorithm fails miserably but that's another bug I need
to find. :-)

Thanks a lot !

Sincerely yours,
d.
-- 
GPG/PGP key: A3AD7A2A David MENTRE <dmentre at linux-france.org>
 5996 CC46 4612 9CA4 3562  D7AC 6C67 9E96 A3AD 7A2A