comp.graphics.algorithms

Subject: Correctness of Dijkstra & A*

---

Hi

I'm currently working on a routeplanning system and I need to account
for the correctness of dijkstras algorithm and A* from it's consistency
property. I'm using a straight line heuristic (for shortest path) and a
drivetime heuristic, calculated from the straight line (for fastest path).

I know HOW the algorithms work, but I can't get my head around the
scientific argument for WHY they work. I don't need a mathematical
proof, just a short (if possible) argument.

Can someone help me either by describing it or leading me in the right
direction?

/Mikkel

Reply

---

View All Messages in comp.graphics.algorithms

path:


Replies:
Re: Correctness of Dijkstra & A*