An efficent priority queue implementation. A prominent algorithm using a priority queue is dijkstras shortest path algorithm. Efficent means constant time insert, constant amortize decrease_priority and amortized O(log n) delete_min operation.


Registered: 2005-10-26 08:10
Activity Percentile: 0%
View project activity statistics.
Developer Info
Project Admins:
Brian Schröder
Developers:
1 [View Members]
 

 

Latest File Releases
Package Version Date Notes / Monitor Download
priority-queue0.1.2 October 27, 2005 Release Notes - Monitor this package Download
 

Public Areas
Home Page Project Home Page
TrackerTracker

 - Bugs ( 0 open /0 total )
Bug Tracking System

 - Support Requests ( 0 open /0 total )
Tech Support Tracking System

 - Patches ( 0 open /0 total )
Patch Tracking System

 - Feature Requests ( 0 open /0 total )
Feature Request Tracking System

Forums Public Forums ( 2 messages in 2 forums )
Docs DocManager: Project Documentation
 

  
Latest News
Now available as a gem
    Brian Schröder - 2005-11-01 08:39
Priority-Queue Initial Release
    Brian Schröder - 2005-10-29 01:15