All,
Finding the shortest path is similar to the "traveling salesman problem" but isn't exactly the same ... basically a path does not need to visit all the nodes. This is really the same as finding the shortest path on a weighted graph. There are alot of university text books out there (Grossman
sushil soni wrote:
Dear All
I want to draw a shortest path between source node to destination node
covering some nodes in between. It is like "traveling salesman problem". Has
anybode worked in TSP with GeoTools API?
Please help me in this regard and let me know if there is any other way to
c
