<feed xmlns='http://www.w3.org/2005/Atom'>
<title>pkgsrc/devel/ruby-priority-queue, branch TNF</title>
<subtitle>[no description]</subtitle>
<id>https://git.osdyson.ru/mirror/pkgsrc/atom?h=TNF</id>
<link rel='self' href='https://git.osdyson.ru/mirror/pkgsrc/atom?h=TNF'/>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/'/>
<updated>2006-05-03T05:17:48Z</updated>
<entry>
<title>Import ruby-priority-queue.</title>
<updated>2006-05-03T05:17:48Z</updated>
<author>
<name>minskim</name>
<email>minskim@pkgsrc.org</email>
</author>
<published>2006-05-03T05:17:48Z</published>
<link rel='alternate' type='text/html' href='https://git.osdyson.ru/mirror/pkgsrc/commit/?id=7ffe07213d91efeb9fade4c98e5ace84546277f4'/>
<id>urn:sha1:7ffe07213d91efeb9fade4c98e5ace84546277f4</id>
<content type='text'>
This is a fibonacci-heap priority-queue implementation.  This project
is different from K. Kodamas PQueue in that it allows a decrease key
operation.  That makes PriorityQueue usable for algorithms like
dijkstras shortest path algorithm, while PQueue is more suitable for
Heapsort and the like.</content>
</entry>
</feed>
