BFS(广度优先遍历)
public void BFS(Graph G,start){
//队列
Queue Q;
//visit 数组
boolean[] visit= new boolean[G.size()
BFS(广度优先遍历)
public void BFS(Graph G,start){
//队列
Queue Q;
//visit 数组
boolean[] visit= new boolean[G.size()