priorityq.java

来自「最小生成树 支持鼠标点击生成结点 并且动态生成最小树」· Java 代码 · 共 58 行

class priorityQ{
private final int SIZE = 20;
private edge queArray[];
private int size;

public priorityQ(){
queArray = new edge[20];
size = 0;
}

public void insert(edge edge1){
int i;
for(i = 0; i < size; i++)
if(edge1.distance >= queArray[i].distance)
break;

for(int j = size - 1; j >= i; j--)
queArray[j + 1] = queArray[j];

queArray[i] = edge1;
size++;
}

public edge removeMin(){
return queArray[--size];
}

public void removeN(int i){
for(int j = i; j < size - 1; j++)
queArray[j] = queArray[j + 1];

size--;
}

public edge peekMin(){
return queArray[size - 1];
}

public int size(){
return size;
}

public boolean isEmpty(){
return size == 0;
}

public edge peekN(int i){
return queArray[i];
}

public int find(int i){
for(int j = 0; j < size; j++)
if(queArray[j].destVert == i)
return j;

return -1;
}
}