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 --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
