// a simple queue to help you to finish your method BFS in class myGraph
// you can use method "enqueue", "dequeue" and "isEmpty", and don't change this class
class Queue 
{
	private int size;
	private int front;
	private int rear;
	private int[] listArray;

	Queue(int sz)  //constructor
	{ size = sz + 1; front = rear = 0; listArray = new int[sz + 1];}

	public void enqueue(int vert)
	{
		rear = (rear + 1) % size;
		listArray[rear] = vert;
	}

	public int dequeue()
	{
		front = (front + 1) % size;
		return listArray[front];
	}

	public boolean isEmpty()
	{
		return front == rear;
	}

}