Loading...
Please wait, while we are loading the content...
Similar Documents
ABSTRACT A Simple Implementation Technique for Priority Search Queues
| Content Provider | CiteSeerX |
|---|---|
| Author | Hinze, Ralf |
| Abstract | This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation supports logarithmic access to a binding with a given key and constant access to a binding with the minimum value. Priority search queues can be used, for instance, to give a simple, purely functional implementation of Dijkstra’s single-source shortest-paths algorithm. data types and views. Priority search queues have been largely ignored by the functional programming community and we believe that they deserve to be known better. Views prove their worth both in defining a convenient interface to the abstract data type and in providing a readable implementation. Categories and Subject Descriptors |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Priority Search Queue Simple Implementation Technique Abstract Data Type Dijkstra Single-source Shortest-paths Algorithm Logarithmic Access Readable Implementation Functional Implementation Finite Map Convenient Interface Amazing Blend Priority Queue Subject Descriptor Minimum Value Functional Programming Community Data Type Constant Access New Implementation Technique |
| Content Type | Text |
| Resource Type | Article |
