I need to build a program something like 2D version of google earth.
I don't have to scroll the map or zoom in/out. I just need to allow user to add new city and find the path between cities.
I need to find the shortest path between 2 cities.
Do you know any idea how to start?
I have programmed a game similar to this, a character finds the path like in heroes. But here, i am a bit confused. :confused:
I think first i need to define the ways that we can go through. I just need some advices about where to start.
Do you have any suggestion?
Google for "Dijkstra Shortest Path".
Originally Posted by OmerHalit
I was planning to use A star, because it uses less memory than dijkstra..
But i just need advice about where to start..
I have a map, i am planning to divide it into small squares(virtually) like 10x10 px and define every cell whether it is road or not..
any other idea than this? or should i continue with this idea. it will take much time to define every cell if we have a map which is 1600x1200 px. i am just scared of this part..