Efficient Priority Queue Constructed on Heap-like Data Structure

Authors

Binbin Qi, Department of Educational Technology, Nanjing Normal University, Nanjing 210097, China;
Mingyong Pang, Department of Educational Technology, Nanjing Normal University, Nanjing 210097, China;

Abstract

Abstract: How to organize data structure is a very important issue for various algorithm implementations. In this paper, a novel and efficient priority-queue was presented based on a kind of heap-like data structure. The organization structure of the queue is first introduced and then a set of basic operators on the queue were elucidated, the time and space performances of the data structure was also theoretically analyzed. Our data structure has several advantages, including the adaptability of storage space as well as the simplicity and convenience of implementation. Experimental results showed that the heuristic priority queue data structure can effectively improve the performance of various types of simulation systems, relative to its traditional counterparts. Our data structure can be used to solve a variety of application problems such as combinatorial optimization.

Recommended Citation

Qi, Binbin and Pang, Mingyong (2020) "Efficient Priority Queue Constructed on Heap-like Data Structure," Journal of System Simulation: Vol. 29: Iss. 1, Article 13.
DOI: 10.16182/j.issn1004731x.joss.201701013
Available at: https://dc-china-simulation.researchcommons.org/journal/vol29/iss1/13

First Page

91

Revised Date

2015-07-07

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201701013

Last Page

98

CLC

TP391

Recommended Citation

Qi Binbin, Pang Mingyong. Efficient Priority Queue Constructed on Heap-like Data Structure[J]. Journal of System Simulation, 2017, 29(1): 91-98.

DOI

10.16182/j.issn1004731x.joss.201701013