Description: Priority queue is 0 or more elements of the set, each element has a priority or value, on the implementation of priority queue operations are 1) search 2) insert a new element 3) Delete. At a minimum priority queue ( min priorityq ueue), the search operation to search for the smallest element of priority, the delete operation to remove the element to the maximum priority queue (max priority queue), the largest search operation to search the priority elements of the delete operation to Remove the element. priority queue elements can have the same priority, search and delete operation can be carried out according to any priority.
To Search:
File list (Check if you may need any files):
优先队列\Debug\vc60.idb
........\.....\vc60.pdb
........\.....\优先.obj
........\.....\优先队列.exe
........\.....\优先队列.ilk
........\.....\优先队列.pch
........\.....\优先队列.pdb
........\.....\排序.obj
........\sz.txt
........\优先.cpp
........\优先队列.dsp
........\优先队列.dsw
........\优先队列.ncb
........\优先队列.opt
........\优先队列.plg
........\Debug
优先队列
Download