无权图的最短路径JAVA_无权最短路径算法java

void unWeightedShortestPath(Graph G,int s){
  LLQueue q = new LLQueue();
  int v,w;
  q.enQueue(s);
  for(int i = 0;i<G.vertexCount;i++){
    Distance[i] = -1;
  }
  Distance[s] = 0;
  while(!q.isEmpty()){
    v = q.deQueue();
    for(int j = 0;j< G.vertexcount;j++){
      if(adjMatrix[v][j] == 1){
        Distance[w] = Distance[v] + 1;
        Path[w] = v;
        q.enQueue(w);
      }
    }
  }
  q.deleteQueue();
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20