Hi everybody, first of all, sorry for the unclear subject. Second I'm NOT looking on how to use AStar or Dijkstra – I think the documentation is sufficient here.
I build a graph representing a road network – done. Now I have a few LineStrings. I want to find the edges that follow a LineString best. But the LineStrings do NOT match the edges in the graph a 100%. Therefore I want to do some geometrical (distance) and topological (based on the road network) matching to find the best path. I believe the BradthFirstIterator or the BradthFirstTopologicalIterator could solve it. My problem is that I don't really get the idea on how to use the graph-api (how the iterator, traversal, walker and visitor interact with each other). I'm studying the graph-package source code including the unit test to figure it out, but... for more than two days now :-( So far, I can find the starting edge (I select the edge with the closest distance to the first coordinate in the LineString – I know, that it doesn't cover all cases, but it'll do to get started.) How do I traverse the Graph from the starting edge? I need to select all connecting edges and pick the one matching my LineString best... Thanks Pete ------------------------------------------------------------------------------ Apps built with the Adobe(R) Flex(R) framework and Flex Builder(TM) are powering Web 2.0 with engaging, cross-platform capabilities. Quickly and easily build your RIAs with Flex Builder, the Eclipse(TM)based development software that enables intelligent coding and step-through debugging. Download the free 60 day trial. http://p.sf.net/sfu/www-adobe-com _______________________________________________ Geotools-gt2-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/geotools-gt2-users
