Hi,
My client will input two values say A and B.
Here A and B represent cities. The source is A and the Destination is B
Now i have to find the shortest route for these two cities
One is using Dijktra's algorithm. But there one has two provide the other values too.
eg He starts from A and reaches to B, via A1,A2,A3, B1,B2,B3
we get all the distances from one place to all the above mentioned places and can find out the shortest path.
But my prblem is how shall i find what are the places that lies between these two cities A and B and other distances.
If I take the latitude/longitude of A and B, how shall I find the cities that lies between these two places and then calculate the distance.
Any suggestions pls
regards
cmrhema
My client will input two values say A and B.
Here A and B represent cities. The source is A and the Destination is B
Now i have to find the shortest route for these two cities
One is using Dijktra's algorithm. But there one has two provide the other values too.
eg He starts from A and reaches to B, via A1,A2,A3, B1,B2,B3
we get all the distances from one place to all the above mentioned places and can find out the shortest path.
But my prblem is how shall i find what are the places that lies between these two cities A and B and other distances.
If I take the latitude/longitude of A and B, how shall I find the cities that lies between these two places and then calculate the distance.
Any suggestions pls
regards
cmrhema
Comment