搜索资源列表
tudeshixian
- 无向图的实现和深度优先算法-no plans to the realization of the depth and priority algorithm
140019
- 基于A*算法的八数码问题的课程设计报告 设计任务：运用所学的关于搜索策略的算法（广度优先，深度优先，A*算法等）解决八数-A * algorithm based on the eight digital design a curriculum to design tasks : use study on the search strategy algorithm (breadth, depth priority, A * algorithm, etc.) to resolve several
linsang
- 很多涉及图上操作的算法都是以图的遍历操作为基础的，此程序演示出图的遍历的过程。通过邻接矩阵存储结构实现数据俄的输入，实现图的深度优先遍历和广度优先遍历过程的演示，对异常输入信息报错。-map of algorithms are plans to traverse the basis for the operation, this procedure demonstrated map out the ergodic process. Through the adjacency matrix of
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! !
graphshguang
- 图的深度优先遍历和广度优先遍历，以邻接矩阵方式输入。（按照提示输入）！ -map the depth and breadth traversal priority priority traverse to the adjacency matrix input. (According to the prompt entry)!
564561354654
- 包括无向图的深度优先搜索，普里姆算法构造最小生成树，数据结构习题的答案-including undirected graph of the depth-first search, Primbetov tectonic minimum spanning tree algorithm and data structure Exercise answer!
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the out
bahuanghou44444
- 八皇后问题的拓展，n皇后问题的深度优先算法，可以把结果以文件形式输出。N<=20-eight of the Queen's expansion, n depth of the Queen's priority algorithm, the results can be output in the form of a document. N
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
GraphMatrix
- 以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan
DFSearch
- 数据结构（C＋＋版）的演示程序，详细演示深度优先搜索的具体调用过程,-data structure (C + + version) demonstration program, a detailed demonstration of the depth-first search to the specific call process,
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.
my8num.RAR
- 八数码问题的深度优先算法，优秀的显示效果。-eight digital depth of the priority algorithm, showed excellent results.
TJU1103
- 同济大学ACM题库TJU1103的题解代码.深度优先搜索的一个好例子.-TJU1103 Tongji University ACM questions in the code that solution. Depth-first search of a good example.
sousuo
- 一个c++程序，主要功能是人工智能中的深度优先遍历和广度优先遍历，用链表实现。-a c procedures, artificial intelligence is the main function of depth-first traversal and breadth priority traversal using chain to achieve.