搜索资源列表
mat
- 深度优先搜索算法Matlab源码 ％ 此程序从国外网站收集得到，是标准的深度优先搜索算法，可实现节点遍历和检测回路的功能，详细情况请看原英文注释 ％ 我在此程序中添加了随机性，即遇到分叉时，随机选下一个节点，成为随机深度优先搜索算法
SEAL_det_v1.0.rar
- 基于深度优先搜索算法的球形译码，具体文献可以参考03年information thoery上的那篇经典文章,Depth-first search algorithm based on spherical decoding, can refer to specific literature in 2003 on information thoery came across a classic article
flow_trade
- 对一电力网络实现顺流跟踪，计算分流比例因子，深度优先搜索供电路径，计算发电机在负荷中的分配比例等。-Downstream of a power network tracking, triage scale factor calculation, depth-first search powered path, calculating the distribution of generators in the load ratio.
sousuosuanfa
- 深度优先搜索算法Matlab源码-深度优先搜索算法Matlab源码。。。。。
BFSN_Algorithm
- 本matlab函数是广度优先搜索邻居的聚类算法实现，仅供参考！-The matlab function is breadth-first search neighbor clustering algorithm for reference purposes only!
wireless
- 无线网络中的深度优先搜索算法,实现在无线网络中的节点的搜索-DFC in wireless network
huisuzuhe
- 利用回溯算法解决组合问题。构造虚拟二叉树，采取深度优先搜索方式得到解。-Backtracking algorithm to solve combinatorial problems. Construct a virtual binary tree, the depth-first search to get the solution.
Breadth-first-search-algorithm
- 广度优先搜索算法判断图的连通性Breadth first search algorithm of judgment figure connectivity -Breadth first search algorithm of judgment figure connectivity
matlab
- 关于黄金分割法和二次插值法的Matlab语言实现，它们都是建立在搜索区间的优先确定基础上实现的。-About the golden section method and quadratic interpolation method Matlab language, they are built on the search interval is determined based on priority implementation.
BFS
- 广度优先搜索算法，做了很详细的解释，大家可以有空学习交流下。-Breadth-first search algorithm, and made a very detailed explanation, you can free exchange under studying.
图论算法的matlab程序实现
- 本资源涵盖了几乎所有matlab图论领域里的算法代码，最短路问题、TSP、最大流、深度优先搜索、广度优先、蚁群算法等等，可为功能强大。
BFS
- 用MATLAB写的宽度优先搜索函数，支持障碍设置和四叉树/八叉树的选择，在路径搜索方面有用。-First search function using MATLAB written in width, support the obstacles set up and quadtree/octree useful in terms of route search.
BFSN_Algorithm
- 一种基于广度优先搜索邻居的聚类算法matlab算例-A clustering algorithm based on breadth-first search neighbors
BFS&DFS
- 广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点。 深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its line, extending in the direct