seqpqueuetest.cpp

数据结构c++-书的一些源代码

#include <iostream.h>
#include <stdlib.h>

const int MaxQueueSize = 5;
typedef int ElemType;
#include "SeqPQueue.h"

void main(void)
{
	SeqPQueue myQueue;
	DataType test[] = {{1,30}, {2,20},{3,40},{4,20},{5,0}}, temp;
	int n = 5;

	for(int i = 0; i < n; i++)
		myQueue.Append(test[i]);
	
	cout << "taskNo   priority" <<endl;
	for(i = 0; i < n; i++)
	{
		if(myQueue.NotEmpty())
		{
			temp = myQueue.Delete();
			cout << temp.elem << "        " ;
			cout << temp.priority <<endl;
		}
	}
}