On Thu, Nov 12, 2015 at 22:42:45 +1100, David Gibson wrote:
> This uses the lpq module as the implementation of the priority queue. That
> means this implementation is some way behind the theoretical efficiency of
> Dijkstra's algorithm. It should be reasonably straightforward to swap out
> the priority queue for a better one in the future, though.
Have you considered using the heap module?
Thanks,
Emilio
_______________________________________________
ccan mailing list
[email protected]
https://lists.ozlabs.org/listinfo/ccan
