fibheap. [Perky]씨가 만든 FibonacciHeap [Python] 모듈 ([PythonCeeExtension])

http://fallin.lv/distfiles/fibheap-0.1.tar.gz 

사용예제
{{{#!python
>>> import fibheap 
>>> f = fibheap.fibheap() 
>>> f[5] = 'merong' 
>>> f[10] = 'hehe' 
>>> f[15] = 'zzan~' 
>>> dir(f) 
['__class__', '__cmp__', '__delattr__', '__delitem__', '__doc__', '__getattribute__', 
'__getitem__', '__hash__', '__init__', '__len__', '__new__', '__reduce__', '__repr__', 
'__setattr__', '__setitem__', '__str__', 'drop', 'has_key', 'peek', 'peekitem', 'pop', 
'popitem'] 
>>> f.peek() 
'hehe' 
>>> f.peekitem() 
(10, 'hehe') 
>>> f.popitem() 
(10, 'hehe') 
>>> f.popitem() 
(5, 'merong') 
>>> f.popitem() 
(15, 'zzan~') 
}}}

value의 크기에 따라 처음부터 pop을 한다. [Python] 2.3부터는  PriorityQueue라는 모듈이 비슷하게 동작함

예제 : [Cluster.py]

----
CategoryProgramLibrary