A data structure for manipulating priority queues 论文
1978Communications of the ACM引用 317
Software Testing and Debugging TechniquesAlgorithms and Data CompressionFormal Methods in Verification
摘要
A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.