图的BFS与DFS

最新推荐文章于 2024-05-19 21:34:53 发布

Durian_piza

最新推荐文章于 2024-05-19 21:34:53 发布

阅读量54

点赞数

分类专栏：数据结构与算法文章标签：深度优先宽度优先 java

本文链接：https://blog.csdn.net/Durian_piza/article/details/129978731

版权

数据结构与算法专栏收录该内容

7 篇文章 0 订阅

订阅专栏

一、BFS

BFS广度遍历大多数用队列来实现
在这里插入图片描述

public static  void BFS_G(HashMap<String,String []> graph, String   s) {
        LinkedList<String> stack = new LinkedList<>();
        stack.addLast(s);
        HashSet<String> seen = new HashSet<>();
        seen.add(s);
        while (!stack.isEmpty()) {
            String vertrix = stack.pollFirst();
            String[] nodes = graph.get(vertrix);
            for (String w : nodes) {
                if (!seen.contains(w)) {
                    stack.addLast(w);
                    seen.add(w);
                }
            }
            System.out.println(vertrix);
        }
    }
    public static void main(String[] args) {
        Dijkstra s=new Dijkstra();
        HashMap<String,String[]> graph = new HashMap <>();
        graph.put("A", new String[]{"B", "C"});
        graph.put("B",new String[]{"A","C","D"});
        graph.put("C",new String[]{"A","B","D","E"});
        graph.put("D",new String[]{"B","C","E","F"});
        graph.put("E",new String[]{"C","D"});
        graph.put("F",new String[]{"D"});
        Dijkstra.BFS_G(graph,"A");
    }

二、DFS

DFS深度遍历一条路走到天黑有点像递归，没路走了再回溯，大多数用栈来实现
在这里插入图片描述

 public static  void DFS_G(HashMap<String,String []> graph, String   s) {
        Stack<String> stack = new Stack<>();
        stack.add(s);
        HashSet<String> seen = new HashSet<>();
        seen.add(s);
        while (!stack.isEmpty()) {
            String vertrix = stack.pop();
            String[] nodes = graph.get(vertrix);
            for (String w : nodes) {
                if (!seen.contains(w)) {
                    stack.add(w);
                    seen.add(w);
                }
            }
            System.out.println(vertrix);
        }
    }
    public static void main(String[] args) {
        Dijkstra s=new Dijkstra();
        HashMap<String,String[]> graph = new HashMap <>();
        graph.put("A", new String[]{"B", "C"});
        graph.put("B",new String[]{"A","C","D"});
        graph.put("C",new String[]{"A","B","D","E"});
        graph.put("D",new String[]{"B","C","E","F"});
        graph.put("E",new String[]{"C","D"});
        graph.put("F",new String[]{"D"});
        Dijkstra.DFS_G(graph,"E");
    }