搜索资源列表
1915
- poj1915求移动棋子到特定位置的最少次数,BFS经典题目-poj1915 for mobile pawn to a specific location of the minimum number, BFS Classic Title
match
- 三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)
USACO3.2.5
- 【USACO3.2.5】魔板 ，经典ACM题，采用BFS-[] USACO3.2.5 magic board, ACM Classic title, the use of BFS
exBFS
- 八数码，是经典的ACM题目中， 采用BFS的例子-Eight digital, ACM is a classic topic, using the example of BFS
DSchen
- 二叉树建立，先序，中序，后序遍历，图的DFS，BFS演示程序，不断更新中，欢迎提建议-Tree establishment, the first order, in sequence, after the traversal, graph DFS, BFS presentation procedures, constantly updated, welcomed the proposals
BFS_Demo
- Demo s algorithm BFS
BFS(Release20080704)
- pb和flash直接通信,用pb程序来控制flash动画-pb and the flash direct communications, pb procedures used to control the flash animation
ACM_ICPC_Search__By_ACMaryland
- ppt about search(bfs && dfs) used in ACM_ICPC
maze_dfs
- solve maze with dfs and bfs
4.1
- 采用图的邻接表作为图的存储结构，完成有向图和无向图的DFS和BFS操作-The use of maps as a chart table adjacent to the storage structure, the completion of directed graph and undirected graph operations of DFS and BFS
disanti
- (1)自选存储结构，输入含n个顶点（用字符表示顶点名称）和e条边的图G； (2)指定任意顶点x为初始顶点，对图G作DFS遍历，输出DFS（深度优先）顶点序列(提示:使用栈实现DFS)； (3)指定任意顶点x为初始顶点，对图G作BFS（广度遍历），输出BFS顶点序列(提示:使用队列实现BFS)； (5)输入顶点x，查找图G:若存在含x的顶点，则删除该结点及与之相关连的边，并作DFS遍历(执行操作3)；否则输出信息“不存在x”； (6)判断图G是否是连通图，输出信息“YES”/“NO
LTDT5
- demo BFS,DFS algorithm
ZOJ1055-Oh_Those_Achin_Feet
- ZOJ 1055 Oh, Those Achin Feet.bfs求最短路径. -ZOJ 1055 Oh, Those Achin ' Feet.bfs seek the shortest path.
BFS
- 無向圖+array of linked list製成 歡迎參考-nondirected, array of linked list
shixiantudebianli
- MatToList(MGraph g,ALGraph *&G)：将邻接矩阵g转换成邻接表G。 ListToMat(ALGraph *G,MGraph &g)：将邻接表G转换成邻接矩阵g。 DispMat(MGraph g)：输出邻接矩阵g。 DispAdj(ALGraph *G)：输出邻接表G。 DFS(ALGraph *G,int v)：以递归的方法从顶点v深度优先遍历图G。 =
DFS-BFS
- BEST FIRST SEARCH AND DEEP FIRST SEARCH
ada4
- bfs,counting sort ,dijaksta ,and many more for ada
Graph_Traversal_DFS_and_BFS
- Graph Traversal,DFS and BFS
DFS
- 图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
acmcontesttemplate
- Bfs，Dijstara，Floyd，Kruskal，Prim，并查集，网络流，Trie等acm竞赛模板-Bfs Dijstara Floyd Kruskal Prim and the set of network flow Trie search such acm contest template