搜索资源列表
广度九宫
- 人工智能中的广度搜索的九宫问题 用VC实现-breadth of artificial intelligence search JiuGongTu issue with VC
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.
基于AI的问题求解
- 提供了深度优先搜索,广度优先搜索,添加启发信息的最小代价搜索,查找多个解,查找最优解的范例程序.-a depth-first search, breadth- first search, add the information inspired the minimum price for a search of solutions to search, find out the optimal solution sample progr
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
grapher
- 用图形用户界面表示的图，数据结构基本应用，最小生成树算法，最短路径，广度、深度优先搜索-graphical user interface with the plan said, the basic data structure application, the minimum spanning tree algorithm, the shortest path, breadth, depth-first search
Graph2
- 二叉树的遍历、线索化、遍历线索化二叉树等算法；深度搜索优先、广度搜索优先算法， 最小生成树、最短路算法。-Binary tree traversal, threaded, threaded binary tree traversal algorithms, such as the depth of the search priority, breadth of search priority algorithm, minimum
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
8num
- 八数码问题的简单算法，广度优先 字数补丁.exe-8 digital issues simple algorithm, breadth-first words patch. Exe
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
- 使用图的深度遍历实现的邻接表存储结构和基本操作函数，在此基础上实现图的广度遍历算法-The use of graph traversal depth achieve adjacency list storage structure and basic operation function, on the basis of the realization of graph breadth traversal 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