heap is a kind of priority queue. : Heapq : Buildin Module PYTHON TUTORIALS

Ajax
Ajax Examples Ajax Tutorials Scripts and Programs
Javascript
Javascript Examples Tutorials DHTML Tutorials Javascript References Scripts and Programs
HTML
HTML Tutorials HTML References HTML DOM 0 References HTML DOM 2 References
CSS
CSS Tutorials CSS References
PHP
PHP Source Code PHP References Scripts and Programs
C#
C# Source Code C# Examples

PYTHON TUTORIALS » Buildin Module » Heapq »

heap is a kind of priority queue.


from heapq import *
from random import shuffle

data = range(10)
shuffle(data)
heap = []

for n in data:
   heappush(heap, n)

print heap
heappush(heap, 0.5)
print heap

Related Scripts with Example Source Code in same category :

pop element from heap

PYTHON TUTORIALS

Buildin Module
» Heapq

Command line
Signal
Copy
Stat
Datetime
Struct
Environment
Subprocess
Fileinput
Sys
Heapq
Syslog
Inter2
Time
Math
Unit test
Os
Webbrowser
Platform
Win32api
Random

Buildin Function

Buildin Module

CGI Web

Class

Collections

Data Type

Database

Dictionary

File

Function

Introduction

List

Network

Operator

Regular Expressions

Statement

String

Thread

Tkinker

Tuple

Windows

WxPython

XML

heap is a kind of priority queue. : Heapq : Buildin Module PYTHON TUTORIALS

PYTHON TUTORIALS » Buildin Module » Heapq »

heap is a kind of priority queue.

Leave a Comment / Note

PYTHON TUTORIALS