搜索资源列表
DFS
- 标准的深度优先搜索算法，可实现节点遍历、产生随机路由、检测图中是否有回路等功能，-Standard depth-first search algorithm, the node traversal can be achieved, resulting in a random routing, testing whether there is any loop diagram functions
dfsorigin
- DFS in Matlab, Depth First Search
hutu
- 应用MATLAB的M文件编程方法过行信号频域分析。分别用矩阵运算的方法计算方波的DFS，在60的时窗宽度上方波宽度分别为5与12。并且画出x(n)和DFS(x(n))的杆状图。-Application of MATLAB M-file programming off-line signal frequency domain analysis. Were calculated using matrix calculation of square wave of DFS, in the 60'
dft
- This contain discrete fourier transform code and inverse discrete fourier transform coded in matlab and also contain dfs and idfs
DFS3
- 我自己用matlab写的深度优先算法，能够实现任意选择起色访问点进行访问的DFS算法-Matlab write my own use depth-first algorithm, to achieve any improvement in access point choose to visit the DFS algorithm
dfs(2)
- dfs algorithm in matlab
BFS&DFS
- 广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点。 深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its line, extending in the direct