<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: Python Heapq</title><link>http://www.bing.com:80/search?q=Python+Heapq</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>Python Heapq</title><link>http://www.bing.com:80/search?q=Python+Heapq</link></image><copyright>Copyright © 2026 Microsoft. All rights reserved. These XML results may not be used, reproduced or transmitted in any manner or for any purpose other than rendering Bing results within an RSS aggregator for your personal, non-commercial use. Any other use of these results requires express written permission from Microsoft Corporation. By accessing this web page or using these results in any manner whatsoever, you agree to be bound by the foregoing restrictions.</copyright><item><title>heapq — Heap queue algorithm — Python 3.15.2 documentation</title><link>https://docs.python.org/3/library/heapq.html</link><description>Source code: Lib/heapq.py This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. Min-heaps are binary trees for which every parent node has ...</description><pubDate>Sat, 14 Nov 2026 20:59:00 GMT</pubDate></item><item><title>Heap queue or heapq in Python - GeeksforGeeks</title><link>https://www.geeksforgeeks.org/python/heap-queue-or-heapq-in-python/</link><description>A heap queue (also called a priority queue) is a data structure that allows quick access to the smallest (min-heap) or largest (max-heap) element. By default, heaps are implemented as min-heaps. Smallest element is always at the root and largest element is located among the leaf nodes of the heap. Python provides a built-in module called heapq that allows to create and work with heap queues ...</description><pubDate>Sun, 15 Nov 2026 02:07:00 GMT</pubDate></item><item><title>Python heapq Module</title><link>https://www.w3schools.com/python/ref_module_heapq.asp</link><description>The heapq module provides heap (priority queue) algorithms on regular Python lists.</description><pubDate>Sat, 14 Nov 2026 03:05:00 GMT</pubDate></item><item><title>heapq | Python Standard Library – Real Python</title><link>https://realpython.com/ref/stdlib/heapq/</link><description>The Python heapq module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. By default, this module implements a min-heap, offering an efficient way to maintain a list in which you want to repeatedly access the smallest item without sorting the entire list. Since Python 3.14, heapq also exposes max-heap counterparts, suffixed with _max, that keep ...</description><pubDate>Thu, 12 Nov 2026 15:17:00 GMT</pubDate></item><item><title>The Python heapq Module: Using Heaps and Priority Queues</title><link>https://realpython.com/python-heapq-module/</link><description>The Python heapq module is part of the standard library. It implements all the low-level heap operations as well as some high-level common uses for heaps. A priority queue is a powerful tool that can solve problems as varied as writing an email scheduler, finding the shortest path on a map, or merging log files.</description><pubDate>Thu, 12 Nov 2026 01:27:00 GMT</pubDate></item><item><title>Heap and Priority Queue using heapq module in Python</title><link>https://www.geeksforgeeks.org/python/heap-and-priority-queue-using-heapq-module-in-python/</link><description>heapq module in Python Heapq module is an implementation of heap queue algorithm (priority queue algorithm) in which the property of min-heap is preserved. The module takes up a list of items and rearranges it such that they satisfy the following criteria of min-heap: The parent node in index 'i' is less than or equal to its children.</description><pubDate>Sun, 08 Nov 2026 00:49:00 GMT</pubDate></item><item><title>Priority Queue in Python</title><link>https://pythonguides.com/priority-queue-in-python/</link><description>Learn how to implement and use priority queues in Python with examples. Know Python’s heapq module and priority queue techniques for efficient task management.</description><pubDate>Sat, 14 Nov 2026 11:12:00 GMT</pubDate></item><item><title>data structures - What is Python's heapq module? - Stack Overflow</title><link>https://stackoverflow.com/questions/19979518/what-is-pythons-heapq-module</link><description>From the book Python Module of the Week under paragraph 2.2 Sorting it is written If you need to maintain a sorted list as you add and remove values, check out heapq. By using the functions in heapq to add or remove items from a list, you can maintain the sort order of the list with low overhead. Here is what I do and get.</description><pubDate>Sun, 15 Nov 2026 05:20:00 GMT</pubDate></item><item><title>Heap — Python Cheat Sheet</title><link>https://www.pythonsheets.com/notes/basic/python-heap.html</link><description>Heap # References Basic Heap Operations Implement Heap Sort with heapq Implement Max Heap Implement Priority Queue with heapq Find K Largest or Smallest Elements Merge Sorted Iterables Maintain a Fixed-Size Heap Heap with Index Tracking The heapq module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. Heaps are binary trees where every parent ...</description><pubDate>Wed, 04 Nov 2026 22:22:00 GMT</pubDate></item><item><title>Python中heapq模块浅析_heapq.heappush-CSDN博客</title><link>https://blog.csdn.net/chandelierds/article/details/91357784</link><description>文章浏览阅读5.5w次，点赞100次，收藏250次。本文深入讲解Python的heapq模块，涵盖堆的基本概念、常用方法如heappush、heapify、heappop及其应用，包括堆排序、优先队列实现及复杂度分析。</description><pubDate>Wed, 08 Mar 2023 11:06:00 GMT</pubDate></item></channel></rss>