Johnathan Kool wrote:
I've managed to work out a visibility algorithm based on Coordinates, Geometry obstacles and LineString paths, but now need to construct a graph so I can run a Dijkstra search (or A*). Essentially, I have a collection of Coordinates/Nodes, and LineStrings representing 'allowable' edges. What's the best way of creating a searchable graph from these objects?
Perhaps an external graph library is the best option. At least Jgrapht (http://www.jgrapht.org/) allows graphs with arbitrary edge and vertex classes. OTOH Jgrapht seems to only implement Dijkstra search - although I'm sure adding A* would be easy.
_______________________________________________ jts-devel mailing list [email protected] http://lists.refractions.net/mailman/listinfo/jts-devel
