图的广度优先遍历

图的广度优先遍历

package sort;

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;

/**图的广度优先遍历
 * Create by ~JH~ on 2018/4/30
 */
public class BFS {
    public static void main(String[] args) {
        BFS bfs=new BFS();
        int [][] re={{0,1,1,0,1},{0,0,0,1,0},{0,0,0,0,0},{0,0,0,0,0},{0,0,0,0,0}};
        List<Integer> queue=new ArrayList<Integer>();
        boolean []visited=new boolean[re.length];
        queue.add(0);
        bfs.bfs(re,queue,visited);
    }

    private void bfs(int[][] re, List<Integer> queue,boolean []visited) {
        while(!queue.isEmpty()){
            int front=queue.get(0);
            queue.remove(0);
            if (visited[front]==false){
                System.out.print(" "+front);
            }
            visited[front]=true;
            for (int i=0;i<visited.length;i++){
                if (visited[i]==false&&re[front][i]==1){
                    queue.add(i);
                }
            }
        }
    }
}