Dijkstra's shortest path implementation

[kuzen]

Hi guys!
The question actually relates to general programming, not to a certain language.
For a driving directions application, when you compose a graph of a city with more than a thousand of points, how do you let the machine know what points are adjacent to a certain one? You know that the closest one is not necessarily directly linked. The only solution I yet see is storing successors and predecessors in the db. for each point. Or is this the way it works?

Thanks

[kenobewan]

Unfortunately we cannot design your project for you. Please scope, plan and begin your project and post any questions that you have in the particular forum that matches the solution that you have chosen. I am applying the below policy:

"The experts on this site are more than happy to help you with your problems but they cannot do your assignment/program for you. Attempt the assignment/program yourself first and post questions regarding any difficulties you have or about a particular function of the code that you don't know how to achieve. This question will now be closed and you will have to post a new question when you're ready.

MODERATOR"