Re: [boost] status of fibonnaci_heap and mutable_queue

Douglas Gregor <doug.gregor@gmail.com> writes:

This would change the complexity of Dijkstra's algorithm from O(|V| lg |V|) to O(|V| lg |E|), where |V| is the number of vertices in the graph and |E| is the number of edges in the graph.

Hmm, did you see: http://lists.boost.org/Archives/boost/2002/01/23970.php and the foregoing thread? -- Dave Abrahams Boost Consulting www.boost-consulting.com