Location:
Search - bfs dfs
Search list
Description: java的DFS(Depth-first search )和BFS(Breadth-first search)的实现-the DFS (Depth-first search) and BFS (Breadth-first search) Implementation
Platform: |
Size: 6144 |
Author: Rachel |
Hits:
Description: BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.
Platform: |
Size: 119808 |
Author: 李想 |
Hits:
Description: 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservation of information to find two nodes vi, vj the shortest path
Platform: |
Size: 3072 |
Author: 光光 |
Hits:
Description: 数据结构中关于DFS和BFS的练习，较简单的实现了二叉树的DFS和BFS搜索-data structure of DFS and BFS practice, the realization of a simple binary tree search DFS and the BFS
Platform: |
Size: 1024 |
Author: 李立纯 |
Hits:
Description: 采用A*算法完成地图路径规划功能,返回得到最短路径,实际效果优于BFS，DFS等算法。-A* algorithm using maps path planning function returns the shortest path, the actual effects are superior to BFS, algorithms such as DFS.
Platform: |
Size: 7168 |
Author: xiaofeng |
Hits:
Description: 比较DFS与BFS
简单的实现了，小地图范围的两种寻路算法原理的比较。
左键控制，可自动寻找路径，方便观察-DFS compared with the simple realization of BFS, the small scope of the two map routing algorithms for comparison. Left control that can automatically find a path to facilitate the observation
Platform: |
Size: 29696 |
Author: 阿申 |
Hits:
Description: Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
-Implemented BFS, DFS and A* To compile this project, use the following command: g++-O search main.cppThen you can run it:./SearchThe input is loaded from a input file in.txtHere is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm.Then there is an integer h indicate the number of heuristic.The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
Platform: |
Size: 3072 |
Author: bo |
Hits:
Description: 两种AstarPathFinder
一种DijkstraPathfinder
BFS，DFS等相关寻路代码总结
带地图随机生成和记时器-AstarPathFinder a two DijkstraPathfinderBFS, DFS and other related routing code summed up with randomly generated maps and timer
Platform: |
Size: 69632 |
Author: JC |
Hits:
Description: 基本数据结构与STL
树及遍历
图的DFS与BFS
-Basic data structures and STL tree and graph traversal DFS and BFS
Platform: |
Size: 223232 |
Author: veryha |
Hits:
Description: 三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)
Platform: |
Size: 1024 |
Author: liulanzheng |
Hits:
Description: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Platform: |
Size: 15360 |
Author: 海霞 |
Hits:
Description: 搜索基础，讲到了基本的几种搜索方法（枚举，DFS,BFS，双向广搜等等）和一些经典的例题，是很好的搜索算法入门教材-Search base, several talked about the basic search methods (enumeration, DFS, BFS, collected the two-way, etc.) and some classic examples, the search algorithm is a good introductory textbooks on
Platform: |
Size: 416768 |
Author: hujiafeng |
Hits:
Description: BFS IMPLEMENT OF GRAPH
Platform: |
Size: 1024 |
Author: mithi |
Hits:
Description: Simple an example for BFS and DFS search
Platform: |
Size: 5120 |
Author: Celil |
Hits:
Description: 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题.zip-8-puzzle A* BFS DFS MFC
Platform: |
Size: 3769344 |
Author: benson |
Hits:
Description: 图论通用各种算法，有大量实例，包括BFS,DFS,Prim, kruskal,Dijkstra,Floyed,Aoe,Aov,topsort-General algorithms of graph theory, a large number of cases, including the BFS, DFS, Prim, kruskal, Dijkstra, Floyed, Aoe, Aov, topsort
Platform: |
Size: 1036288 |
Author: 张前东 |
Hits:
Description: code in c for DFS AND BFS
Platform: |
Size: 9216 |
Author: dief |
Hits:
Description: 在C环境中使用Bfs，Dfs的遍历算法创建邻接表建立图。-C environment Bfs Dfs traversal algorithm to create an adjacency table to create the diagram.
Platform: |
Size: 1024 |
Author: opsqcs |
Hits:
Description: bfs ,dfs algoritm in TC
Platform: |
Size: 1024 |
Author: saghi |
Hits:
Description: 广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点。
深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its line, extending in the direction of the range as far as possible, until all nodes are not repeated.
Depth first search is started from a node, the first node along its search to further down, when not further backtracking node, then a node in the back in the other direction to start the search depth, until not repeated traversal of all nodes.)
Platform: |
Size: 1024 |
Author: Maxxxxx
|
Hits: