From: David Abrahams (dave_at_[hidden])
Date: 2006-04-12 17:10:09
Douglas Gregor <doug.gregor_at_[hidden]> 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:
and the foregoing thread?
-- Dave Abrahams Boost Consulting www.boost-consulting.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk