搜索资源列表
ACM
- ACM练习题 zju1024 zju1940 zju2097 pku2503toj2196 zju1091 zju1507 zju1649 graph bfs-ACM exercises zju1024 zju1940 zju2097 pku2503 toj2196 zju1091 zju1507 zju1649
N-queens-algorithm
- n皇后问题的BFS算法,算法简洁,作为初学者一看就懂,不过先看会BFS算法很重要,这比普通的动态规划速度要快很多-N queens problem BFS algorithm, the algorithm is simple, as a beginner to understand, but first look at the BFS algorithm is very important, which is much faster than the general dynamic planni
bfs
- backward forward sweep power flow analaysis
sousuosuanfa
- 搜索算法. 实现基于树的基本搜索算法(BFS)的哈密顿环. 实现基于树的基本搜索算法(DFS)的哈密顿环. 实现基于爬山法的的哈密顿环. 利用分支界限算法实现最小哈密顿环. -Search algorithm. To achieve the basic algorithm tree search (BFS) Hamiltonian ring. Implement basic search algorithm (DFS) based on tree ring Hamil
4
- 有关于图的最短路径算法,常用的Dijkstra和SPFA算法或可采用堆优化或可采用A*算法加速实现时间复杂度的大幅降低。但是本题中图的边长均为1,使用BFS的时间复杂度较Dijkstra和SPFA有更为明显的降低,尽管看上去BFS更为简单-Figure about the shortest path algorithm, commonly used Dijkstra algorithm and SPFA or heap can be used to optimize or A* algorith
bfs
- 程序的输入是图的顶点序列和边序列(顶点序列以*为结束标志,边序列以-1,-1为结束标志)。程序的输出为图的邻接表和广度优先遍历序列。-Input to the program is a sequence of vertices and edges of a sequence diagram (sequence of vertices with* marks the end edge sequence-1,-1 for the end marker). The output of the prog
graph
- 数据结构-图的操作 1.图的建立 2.图的深搜 3.图的广搜 4.最短路-(1).print the graph. (2).print the sequence of vertex names getting Depth-First Search. (3). print the sequence of vertex names getting Breadth-First Search. Dfs Bfs dijkstra
graph_lin
- 数据结构以及算法实现 图的创建 深搜、广搜、最短路-(1).print the graph. (2).print the sequence of vertex names getting Depth-First Search. (3). print the sequence of vertex names getting Breadth-First Search. Dfs Bfs dijkstra
BFS
- 广度优先遍历是以层为顺序,将某一层上的所有节点都搜索到了之后才向下一层搜索。-Breadth first traversal is based on the order of the layer, will be a layer of all the nodes are searched to the next layer after the search.
a201702123
- 星寻路算法真是我一生接触的第一个人工智能算法了。。。 A星寻路算法显然是用来寻路的,应用也很普遍,比如梦幻西游。。。算法的思路很简单,就是在bfs的基础上加了估值函数。 它的核心是 F(x) G(x) + H(x) 和open、close列表: G(x)表示从起点到X点的消耗(或者叫移动量什么的),H(X)表示X点到终点的消耗的估值,F(x)就是两者的和值。open列表记录了可能要走的区域,close列表记录了不会再考虑的区域。我们每次都选F值最小的区域搜索,就能搜
main
- SAP算法:求最大流有一种经典的算法,就是每次找增广路时用BFS找,保证找到的增广路是弧数最少的,也就是所谓的Edmonds-Karp算法。- SAP algorithm for the maximum flow is a classical algorithm, is each for augmenting path with BFS can guarantee the augmented way to find the minimum number of arcs, which i
8puzzles
- sovling 8puzzles (eight puzzles) problem with IDS and BFS methods in c#. inputs starts 0 to 8.-sovling 8puzzles (eight puzzles) problem with IDS and BFS methods in c#. inputs starts 0 to 8.
BFS
- good example for student
the code
- 泊松分酒问题的一般解 用BFS进行广度优先搜索 实现简单(The general solution of Poisson's wine problem is implemented by BFS, which is simple in breadth first search)
ex3
- code for breadth first search - bfs
Desktop
- POJ 泰国佛塔 (全局题号6048) AC代码 深度优先搜索 广度优先搜索(source code of POJ 6048)
Program1
- 实现广度优先搜索 深度优先搜索 以及 A星算法(Breadth first search, depth first search, and A star algorithm.)
dfsbfsmatlab
- dfs and bfs implementation of matlab code.
SUCMUC
- bfs是宽度遍历,在acm中占着很大的作用,这份课件包含了大部分内容()
073545
- ppt about search(bfs && dfs) used in ACM_ICPC div hr div B 文件列表 B : d()