Fibbonaci heaps are not the fastest way in practice, they are only theoreticaly faster for large enough n. I heard about some techniques where they are only integer numbers.
2008/12/7 TheTravellingSalesman <[EMAIL PROTECTED]> > > I was about to start implemening max flor min cut and shortest path > graphs in C++ and I was wondering whats the most efficient way to do > it that will reduce the run time. > > > So far I know I have to use Fibonacci heap to make it fast. Does > anybody have any other suggestions? Does anyone know of any > implementation already available? > > > > --~--~---------~--~----~------------~-------~--~----~ 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 from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
