?? queue.java
字號:
// 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;
}
}
?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -