搜索资源列表
emploeyee1
- 无向图的深度优先搜索，老师写的，绝对没错-undirected graph of the depth-first search, the teacher was absolutely right!
4.67
- 普里姆算法构造最小生成树，无向图的深度优先搜索。数据结构作业答案。老师写的-Primbetov minimum spanning tree algorithm structure, no plans to the depth-first search. Operating data structure answer. Teachers write! !
564561354654
- 包括无向图的深度优先搜索，普里姆算法构造最小生成树，数据结构习题的答案-including undirected graph of the depth-first search, Primbetov tectonic minimum spanning tree algorithm and data structure Exercise answer!
graphSearch
- 实现了图的搜索算法，包括深度优先搜索，广度优先搜索，Dijstra算法，A*算法等较典型的搜索算法，同时可以进行图的输入和编辑等操作，仅供大家参考。-achieve the plan's search algorithm, including depth-first search, breadth - first search algorithm Dijstra, A * algorithm is more typical search algorithm, and can map th
DFSearch
- 数据结构（C＋＋版）的演示程序，详细演示深度优先搜索的具体调用过程,-data structure (C + + version) demonstration program, a detailed demonstration of the depth-first search to the specific call process,
eclat
- A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists. -A program to find frequent
asdfasxa32
- 掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
8_nums
- 一个九宫问题的源码，a星算法，深度优先广度优先算法都有-a JiuGongTu the source, a Star algorithm, depth-first algorithm has breadth priority
GOOD_DFS_BFS
- 图论中二种遍历图的算法.深度优先遍历,与广度优先遍历.-graph theory two species traverse map algorithm. Depth-first traversal, and the breadth - first traversal.
operate
- 1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal
ChessEight
- 解决八数码问题的经典程序。实现了宽带优先算法，深度优先算法，A* 算法。图形化显示结果。-solve the classic problem of the digital process. Broadband achieved priority algorithm, depth-first algorithm, A * algorithm. Graphic shows results.
TJU1103
- 同济大学ACM题库TJU1103的题解代码.深度优先搜索的一个好例子.-TJU1103 Tongji University ACM questions in the code that solution. Depth-first search of a good example.
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 of the input file: The firs
sousuo
- 一个c++程序，主要功能是人工智能中的深度优先遍历和广度优先遍历，用链表实现。-a c procedures, artificial intelligence is the main function of depth-first traversal and breadth priority traversal using chain to achieve.
Diagram
- 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 （1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algor
2007char
- 利用邻接矩阵的图深度优先遍历算法，调试通过，无毒！-use of adjacency matrix plans depth-first search algorithm, through testing, drug-free!
2007char2
- 利用邻接表的图深度优先遍历算法，调试通过。无毒-use adjacent table plans depth-first traversal algorithm, through debugging. Nonpoisonous
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
shenduguangduyouxiansousuo
- 深度优先搜索、广度优先搜索 vc编程基础，学生作业-depth-first search, breadth - first search vc based programming, students work
shendu
- 在VC界面上实现深度优先搜索、广度优先搜索的功能，操作简单方便-in VC interface to achieve depth-first search, breadth - first search function is easy and simple