BFS模版

import java.util.LinkedList;
import java.util.Queue;
//图的广度优先遍历算法模版
public class bfsMain {
    static boolean[] vis = new boolean[1001];
    static int[][] map = new int[1001][1001];
    static int n;
    static void bfs(int v)
    {
        Queue<Integer> q = new LinkedList<>();
        System.out.print(v + "->");
        vis[v] = true;
        q.add(v);
        while(!q.isEmpty())
        {
            v = q.peek();
            q.poll();
            for(int i=0;i<n;i++)
            {
                if(!vis[v]&&map[v][i] == 1)
                {
                    vis[i] = true;
                    System.out.print(v + "->");
                    q.add(i);
                }
            }
        }
    }
    public static void main(String[] args) {

    }
}