Hi Marko, Marko Mäkelä wrote
There is an efficient algorithm for computing the strongly connected components of a directed graph: http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algori...
Perhaps we could invoke the algorithm in two passes:
(1) on the undirected graph of roads (hard-wiring oneway=no) Each strongly connected component (SCC) would be a routing island. (2) for each SCC from step 1 that contains oneway=yes attributes: If the SCC would be split, list the oneway=yes ways (or some of them).
sounds plausible. I put that on my todo list, but I guess that it has to be done (again) with the RouteNode data, so it will be difficult to identify the OSM ways. The question is: If you get a list of oneway road (parts) which create routing islands, is it really the only conclusion that these oneways are wrong? Gerd -- View this message in context: http://gis.19327.n5.nabble.com/Diagnostic-warnings-for-dead-end-oneway-highw... Sent from the Mkgmap Development mailing list archive at Nabble.com.