-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Am 21.06.2010 13:28, schrieb Curt Nowak: > Hi Oleg, > > in order to get a well connected graph (i.e. a graph in which > every node is reachable from every other node in that graph) I use > the follwowing procedure: > > ... > > If your map contains m disjunct well connected graphs, you will > end up with m clusters. Then I simply delete all but the largest > cluster. In my findings (map of Germany) this main cluster > contains ~99% of the nodes if I remember correctly, so I don't > really mind deleting the rest. > > Curt
I think your idea falls apart when there are oneway-streets. Something we have lots of. It may however not be of practical relevance. Marcus -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkwfT10ACgkQf1hPnk3Z0cTmMgCgkqo3GlawVi+7oST+pyFprXsG ibwAn2E6upkTOjyx28aF2r2cCddsgyz4 =2GcD -----END PGP SIGNATURE-----
_______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
