Functional Binomial Queues

Functional Binomial Queues (1994)

by David King

Venue:	In Glasgow Workshop on Functional Programming
Citations:	11 - 0 self

Datum	Value	Source
TITLE	Functional Binomial Queues	SVM HeaderParse 0.1
AUTHOR NAME	David J. King	SVM HeaderParse 0.1
ABSTRACT	Efficient implementations of priority queues can often be clumsy beasts. We express a functional implementation of binomial queues which is both elegant and efficient. We also quantify some of the differences with other functional implementations. The operations decreaseKey and delete always pose a problem without destructive update, we show how our implementation may be extended to express these. 1 Functional priority queues A crucial part of many algorithms is the data structure that is used. Frequently, an algorithm needs an abstract data type providing a number of primitive operations on a data structure. A priority queue is one such data structure that is used by a number of algorithms. Applications include, Dijkstra's [4] algorithm for single-source shortest paths, and the minimum cost spanning tree problem (see Tarjan [12] for a discussion of minimumspanning tree algorithms). See Knuth [8] and Aho et al [1] for many other applications of priority queues. A priority queue is a set where each element has a key indicating its priority. The most common primitive operations on priority queues are: emptyQ Return the empty queue. isEmpty q Return True if the queue q is empty, otherwise return	SVM HeaderParse 0.1
CITATIONS	13 found	ParsCit 1.0