Wanja Chresta added the comment:
After thinking about it some more I realised that this doesn't make sense since
heapq is based on lists and lists have an insertion complexity of O(n). Thus,
they'll never read the needed O(log n) and heapq is the wrong place.
Change by Wanja Chresta :
--
type: -> enhancement
___
Python tracker
<https://bugs.python.org/issue35659>
___
___
Python-bugs-list mailing list
Unsubscrib
New submission from Wanja Chresta :
Heap Queues are extremely useful data structures. They can, for example, be
used to implement Dijkstra's algorithm for finding the shortest paths between
nodes in a graph in O(edge * log vertices) time instead of (edge * vertices)
without heaps.
