深度优先搜索算法(DFS,Depth First Search)的PHP实现
2014-10-25 03:09
369 查看
深度优先搜索的实现
实现输出结果
V1
-V2
--V5
---V6
----V3
----V8
---V9
-V4
--V7
<?php class Search_Method { //无向图的数组描述 private $dfs_save; //全局记录数组 private $arr; //控制分支- private $k = 0; public function __construct() { $this->dfs_save = array( array(0,1,1,1,0,0,0,0,0), array(1,0,0,0,1,0,0,0,0), array(1,0,0,0,0,1,0,0,0), array(1,0,0,0,0,0,1,0,0), array(0,1,0,0,0,1,0,0,1), array(0,0,1,0,1,0,0,1,0), array(0,0,0,1,0,0,0,0,0), array(0,0,0,0,0,1,0,0,0), array(0,0,0,0,1,0,0,0,0), ); $this->arr = array(); } //深度优先搜索的递归实现方法 public function dfs($v) { //对顶点做一些操作 echo str_repeat("-",$this->k); echo 'V'.($v+1).'<br>'; //记录已访问的顶点 $this->arr[]= $v; //查找与顶点相连接的顶点,如果存在就继续深度优先搜索 for($i=0;$i<9;$i++) { if(!in_array($i,$this->arr)&&$this->dfs_save[$v][$i]==1) { $this->k++; $this->dfs($i); } } $this->k--; return; } } ?>
实现输出结果
V1
-V2
--V5
---V6
----V3
----V8
---V9
-V4
--V7
相关文章推荐
- PHP实现深度优先搜索算法(DFS,Depth First Search)详解
- [数据结构]深度优先搜索算法(Depth-First-Search,DFS)
- javascript实现的图数据结构的广度优先 搜索(Breadth-First Search,BFS)和深度优先搜索(Depth-First Search,DFS)
- IDDFS(Iterative deepening depth-first search)的Java实现
- Adjacency List表示下Depth-First-Search(DFS)及Breadth-First-Search(BFS)的c++实现
- DFS --- Depth First Search 深度优先搜索算法
- 深度优先搜索Depth-first search (DFS) for undirected graphs
- 深度优先搜索算法(Depth first search)
- 图的遍历之深度优先搜索(Depth-First Search—DFS)
- TensorFlow中的深度优先搜索(Depth-first search, DFS)
- PHP实现广度优先搜索算法(BFS,Broad First Search)详解
- 深度优先算法(depthFirstSearch,DFS)
- DFS(Depth-First-Search)
- Tree-DFS(Depth-First-Search)
- 用栈实现深度搜索(Depth_first_search)
- 【算法总结系列-6】深度优先搜索-Depth First Search,DFS
- 深度优先搜索(Depth-First-Search,DFS)
- DFS-深度优先搜索(Depth First Search)—1
- DFS——深度优先算法(Depth First Search)
- (Basic algorithm学习笔记)《基础算法四》- 深度优先搜索(Depth First Search,DFS )