搜索资源列表
AI_maze
- 载入txt文件迷宫，含几种搜索方法，例如depth first search, breadth first search等-maze included txt file containing several search methods, such as depth first search, breadth first search, etc.
graphSearch
- 实现了图的搜索算法，包括深度优先搜索，广度优先搜索，Dijstra算法，A*算法等较典型的搜索算法，同时可以进行图的输入和编辑等操作，仅供大家参考。-achieve the plan's search algorithm, including depth-first search, breadth- first search algorithm Dijstra, A* algorithm is more typical sear
BFS_DFS_Astar
- 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
BFS_CUDA
- 用CUDA实现BFS算法源码。CUDA是NV公司基于GPU的统一计算架构，BFS复杂度由CPU上的O(V+E)降为O(diameter)，直径diameter即图中root到leaf的最长距离。-This is the algorithm of BFS(breadth first search) on CUDA, and its time complexity is down to O(diameter) which diameter
Breadth-First
- Breadth-First traversal
breadth-first
- 用VB实现 宽度优先算法 可用于游戏找路等-Using VB to achieve breadth-first algorithm can be used in games such as find a way
BFS
- 广度优先搜索算法分析；供程序设计人员使用-Breadth-first search algorithm analysis for programmers to use
8PuzzleProblem
- 实现了简单的宽度优先搜索，算法比较简单，课程设计时可用。-To achieve a simple breadth-first search
search_graph
- 一个python程序，实现了无向图的结构模拟，以及广度优先搜索的算法，以及显示最短路径之一。用leo+ulipad实现。-A python program to realize the structure of an undirected graph simulation, as well as the breadth-first search algorithm, and display one of the shortest pat
bashuma
- 八数码问题的求解系统 利用广度优先搜索方法-8 Puzzle Problem Solving System using breadth-first search method
Breadth-first-traverse
- 数据结构中的连通图的广度优先遍历类似于树的按层次遍历。通过队列的形式实现的。-In data structures, connected graph breadth first traverse similar to tree according to level traversal. Through the queue form to realize.
Breadth-first-search-algorithm
- 学习数据结构的帮手广度优先搜索算法源代码-Breadth-first search algorithm
Breadth-first-search-algorithm
- 广度优先搜索算法判断图的连通性Breadth first search algorithm of judgment figure connectivity -Breadth first search algorithm of judgment figure connectivity
breadth-first-search
- 数据结构经典算法（一）：用邻接表实现广度优先搜索。-Adjacency table to achieve the breadth-first search
breadth-first--algorithm
- 数据结构经典算法C++实现（四）：广度优先（邻接矩阵）算法-Data structures classical algorithm C++ of realization (d): breadth-first (adjacency matrix) algorithm
Breadth-first-search
- 宽度优先搜索 适合于人工智能课程实验所用-Breadth-first search
Breadth-First-Search
- Breadth-First Search SourceCode : C++ windows7, Visual Studio 2008
breadth-first-traversa
- 严蔚敏《数据结构》无向图的广度优先遍历算法c++代码实现-Yan Wei-min data structure undirected graph breadth-first traversal algorithm c++ code to achieve
Breadth-first-traversal-
- 简单的广度优先源代码，可供初学者学习使用。-Simple breadth-first source code, for beginners learning to use
Breadth-First-Search
- c语言，算法，对指定文件夹进行广度优先搜索，输出文件名-C language, algorithm, for the specified folder is breadth first search, the output file name