[algogeeks] Re: correctness of Dijkstras algorithm and A*

Why do you need to prove it? Just accept it as a black box . --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe fr

[algogeeks] Re: Updating element that is not in top of Binary Heap

I'm avoiding updating element as much as I can, as I already maintain separate hash-table with G-cost of each element, so I'm updating only when abosolutely necessary. Oh I must do some profiling to see is the extra complexity worth it. --~--~-~--~~~---~--~~ You

[algogeeks] Re: Updating element that is not in top of Binary Heap

Thank you very much. Is there also anything for finding node in a heap per given key? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegro

[algogeeks] Updating element that is not in top of Binary Heap

I have implementation of A* using Binary heaps, and as usually everything is good untill I need to update elemt in the middle of the heap? Anybody has a good algorithm of doing this efficiently/ thanks bobi --~--~-~--~~~---~--~~ You received this message because y