sqqueue.java

自己编写的人工智能中野人与修道士问题的程序。

package exercise1;

public class SqQueue {
		public final int MAXSIZE =255;

		int front = 0;

		int rear = 0;

		OneState[] array;

		SqQueue() {
			array = new OneState[MAXSIZE];
		}

		public boolean EnQueue(OneState e) {
			if ((rear + 1) % MAXSIZE == front) {
				System.out.println("the Queue has full;");
				return false;
			}
			array[rear] = e;
			rear = (rear + 1) % MAXSIZE;
			return true;
		}

		public OneState DeQueue() {
			if (front == rear) {
				System.out.println(" the Queue is Empty;");
				return null;
			}
			OneState e = array[front];
			front = (front + 1) % MAXSIZE;
			return e;
		}

		public boolean IsEmpty() {
			if (rear == front)
				return true;
			return false;
		}

		public int QueueLength() {
			return (rear - front + MAXSIZE) % MAXSIZE;
		}

		public void DestoryQueue() {
			rear = front;
		}

		public void SelectSort() {
			OneState[] mid = new OneState[this.QueueLength()];
			int i = 0, m = 0;
			while (!IsEmpty()) {
				mid[i++] = DeQueue();
			}
			OneState z = new OneState();
			for (int j = 0; j < i - 1; j++)
				for (int k = j + 1; k<= i - 1; k++) {
					z = mid[j];
					if (mid[k].getEstimate()>z.getEstimate()) {
						z = mid[k];
						m = k;
					}
					mid[m] = mid[j];
					mid[j] = z;

				}
			while (i != 0) {
				EnQueue(mid[--i]);
			}
		}

	}