图的广度优先遍历

标签：ext   print   lin   sem   建议   oid   for   read   广度优先遍历   

import java.util.*;

/**
 * 图的广度优先遍历
 */
public class BreadthFirst {

    public static void bfs(Node node) {
        if (node == null) {
            return;
        }
        Queue<Node> queue = new LinkedList<>();
        HashSet<Node> set = new HashSet<>();
        queue.add(node);
        set.add(node);
        while (!queue.isEmpty()) {
            Node cur = queue.poll();
            System.out.println(cur.value);
            for (Node next : cur.nexts) {
                if (!set.contains(next)) {
                    set.add(next);
                    queue.add(next);
                }
            }
        }
    }

    class Graph {

        public HashMap<Integer, Node> nodes;

        public HashSet<Edge> edges;

        public Graph() {
            nodes = new HashMap<>();
            edges = new HashSet<>();
        }

    }

    class Node {

        public int value;

        public int in;

        public int out;

        public ArrayList<Node> nexts;

        public ArrayList<Edge> edges;

        public Node(int value) {
            this.value = value;
            nexts = new ArrayList<>();
            edges = new ArrayList<>();
        }

    }

    class Edge {

        // 权重
        public int weight;

        public Node from;

        public Node to;

        public Edge(int weight, Node from, Node to) {
            this.weight = weight;
            this.from = from;
            this.to = to;
        }

    }

}

/* 如有意见或建议，欢迎评论区留言；如发现代码有误，欢迎批评指正 */

图的广度优先遍历

标签：ext   print   lin   sem   建议   oid   for   read   广度优先遍历   

原文地址：https://www.cnblogs.com/laydown/p/13123820.html