BFS java实现

public class BFS {
    //存放节点关系的hashtable
    public static void bfs(HashMap> graph, HashMap dist, Character s) {
        //建立队列
        Queue q = new LinkedList<>();
        //给定起始节点
        Character start = s;
        //起始节点放到距离表中
        dist.put(start, 0);
        ((LinkedList) q).add(start);
        //遍历,一定要取出栈顶节点再加入
        while (q != null) {
            //取出栈顶节点和栈顶节点到起始节点的距离
            Character poll = q.poll();
            if(poll == null){
                break;
            }
            Integer distance = dist.get(poll);
            System.out.println("节点" + poll + "到起始节点" + start + "的距离为" + distance);
            distance++;
            //将邻接节点加入
            for (Character c : graph.get(poll)) {
                //如果没遍历过这个节点,加入到队列和距离表中
                if (!dist.containsKey(c)) {
                    dist.put(c, distance);
                    q.offer(c);
                }
            }
        }

    }
}

public class BTS_test {
    public static void main(String[] args) {
        HashMap> graph = new HashMap<>();
        HashMap dist = new HashMap<>();

        // s顶点的邻接表

        LinkedList list_s = new LinkedList();

        list_s.add('A');

        list_s.add('B');

        LinkedList list_a = new LinkedList();

        list_a.add('C');

        list_a.add('D');

        LinkedList list_b = new LinkedList();

        list_b.add('D');

        list_b.add('E');

        LinkedList list_c = new LinkedList();

        list_c.add('E');

        LinkedList list_d = new LinkedList();

        list_c.add('E');


        //构造图

        graph.put('S', list_s);

        graph.put('A', list_a);

        graph.put('B', list_b);

        graph.put('C', list_c);

        graph.put('D', list_d);

        graph.put('E', new LinkedList());


        //调用

       BFS.bfs(graph, dist, 'S');

    }


}

结果：

节点S到起始节点S的距离为0
节点A到起始节点S的距离为1
节点B到起始节点S的距离为1
节点C到起始节点S的距离为2
节点D到起始节点S的距离为2
节点E到起始节点S的距离为2