about A* algorithm
-
pls help me with the code for A* algorithm for finding the shortest path between two points
-
pls help me with the code for A* algorithm for finding the shortest path between two points
Look here.. http://www.codeproject.com/KB/recipes/PathFinderLibrary.aspx[^]
------------------------------------------------------------------ Life would have been much easier if I had the source-code!!
-
pls help me with the code for A* algorithm for finding the shortest path between two points
Member 4756709 wrote:
the shortest path between two points
Is a straight line. :-D Couldn't resist....
- S 50 cups of coffee and you know it's on!
-
pls help me with the code for A* algorithm for finding the shortest path between two points
hmm....the straight line is always not possible with blockages along the path between source to the exit...i dont want the shortest path b/w two points ;P but the shortest out of every available path.... :zzz:
-
Member 4756709 wrote:
the shortest path between two points
Is a straight line. :-D Couldn't resist....
- S 50 cups of coffee and you know it's on!
Only on a 2D/3D surface. In 4D spacetime, it's a geodesic.
Cheers, Vikram.
"If a trend is truly global, then that trend ought to be visible across ANY subset of that data" - fat_boy
-
Only on a 2D/3D surface. In 4D spacetime, it's a geodesic.
Cheers, Vikram.
"If a trend is truly global, then that trend ought to be visible across ANY subset of that data" - fat_boy
Wasn't me that gave your the 1 vote... Doesn't Pythagoras work in any number of dimensions? The geodesic would just be a visualization of it, right?
- S 50 cups of coffee and you know it's on!
-
Wasn't me that gave your the 1 vote... Doesn't Pythagoras work in any number of dimensions? The geodesic would just be a visualization of it, right?
- S 50 cups of coffee and you know it's on!
Pythagoras is only correct in euclidean geometry. It's not the number of dimensions that matters, it's the flatness that does. In flat space a geodesic is a strait line. In curved space a strait line isn't always the shortest path.
Otherwise [Microsoft is] toast in the long term no matter how much money they've got. They would be already if the Linux community didn't have it's head so firmly up it's own command line buffer that it looks like taking 15 years to find the desktop. -- Matthew Faithfull
-
pls help me with the code for A* algorithm for finding the shortest path between two points