heap is a kind of priority queue. : heapq « Buildin Module « Python Tutorial

Python Tutorial 1.  Introduction 2.  Data Type 3.  Statement 4.  Operator 5.  String 6.  Tuple 7.  List 8.  Dictionary 9.  Collections 10.  Function 11.  Class 12.  File 13.  Buildin Function 14.  Buildin Module 15.  Database 16.  Regular Expressions 17.  Thread 18.  Tkinker 19.  wxPython 20.  XML 21.  Network 22.  CGI Web 23.  Windows Java Java Tutorial Java Source Code / Java Documentation Java Open Source Jar File Download Java Articles Java Products Java by API Photoshop Tutorial C# / C Sharp C# / CSharp Tutorial C# / CSharp Open Source ASP.Net ASP.NET Tutorial JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C / ANSI-C C Tutorial C++ C++ Tutorial Ruby PHP Python Python Open Source SQL Server / T-SQL SQL Server / T-SQL Tutorial Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial Flash / Flex / ActionScript VBA / Excel / Access / Word XML XML Tutorial Microsoft Office PowerPoint 2007 Tutorial Microsoft Office Excel 2007 Tutorial Microsoft Office Word 2007 Tutorial

Python Tutorial » Buildin Module » heapq   14. 6. 1. 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 14. 6. heapq 14. 6. 1.  heap is a kind of priority queue. 14. 6. 2.  pop element from heap

www.java2java.com | Contact Us

Copyright 2010 - 2030 Java Source and Support. All rights reserved.

All other trademarks are property of their respective owners.