深度和广度搜索

最新推荐文章于 2024-11-19 23:06:53 发布

jicheng687

最新推荐文章于 2024-11-19 23:06:53 发布

阅读量1.8k

点赞数

CC 4.0 BY-SA版权

分类专栏： Algorithm&amp;DataS 文章标签： iterator integer search methods

本文链接：https://blog.youkuaiyun.com/jicheng687/article/details/4786097

Algorithm&DataS 专栏收录该内容

6 篇文章

订阅专栏

本文深入介绍了两种基本的图搜索算法：广度优先搜索(BFS)和深度优先搜索(DFS)。通过具体的Java实现代码，详细解释了这两种算法的工作原理及应用方式。广度优先搜索采用队列来遍历所有相邻节点，而深度优先搜索则使用递归或栈来深入探索尽可能远的节点路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// implementation independent methods /** breadth-first search * reach[i] is set to label for all vertices reachable * from vertex v */ public void bfs(int v, int [] reach, int label) { ArrayQueue q = new ArrayQueue(10); reach[v] = label; q.put(new Integer(v)); while (!q.isEmpty()) { // remove a labeled vertex from the queue int w = ((Integer) q.remove()).intValue(); // mark all unreached vertices adjacent from weight Iterator iw = iterator(w); while (iw.hasNext()) {// visit an adjacent vertex of weight int u = ((EdgeNode) iw.next()).vertex; if (reach[u] == 0) {// u is an unreached vertex q.put(new Integer(u)); reach[u] = label; // mark reached } } } } /** depth-first search * reach[i] is set to label for all vertices reachable * from vertex v */ public void dfs(int v, int [] reach, int label) { Graph.reach = reach; Graph.label = label; rDfs(v); } /** recursive dfs method */ private void rDfs(int v){ // System.out.println(v); reach[v] = label; Iterator iv = iterator(v); while(iv.hasNext()){ //visti an adjacent vertex of v int u = ((EdgeNode) iv.next()).vertex; if(reach[u] == 0) // u is an unreached vertex rDfs(u); } }