搜索资源列表
asdfasxa32
- 掌握图的邻接矩阵的存储结构;实现图的两种遍历:深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
AIbashuma
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient
AIbashumaJava1
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient
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
BFS11223
- 该程序实现了 无向图的建立和广度优先搜索及输出-the program no plans to the establishment and BFS and output
graphbfs
- 读图并输出图的邻接链表,输入两个结点,用广度优先寻找它们之间的最短路径并输出,并判断其是否是树,是否连通,是否有环,有要打印出来环.-interpret drawings and prints of adjacent chain, the importation of two nodes, with breadth between them priority for the shortest path and output, and a judgment whether it is trees,
sousuo
- 一个c++程序,主要功能是人工智能中的深度优先遍历和广度优先遍历,用链表实现。-a c procedures, artificial intelligence is the main function of depth-first traversal and breadth priority traversal using chain to achieve.
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
wide_search
- 广度优先搜索 c语言实现-BFS c Language
图的遍历
- 数据结构中关于图的遍历,任意建节点,深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods
maze1
- 通过广度优先算法寻找迷宫(nSize*nSize)的最优路径。-breadth - first through the maze to find algorithm (nSize * nSize) the optimal path.
DFSTree.cpp
- 广度优先遍历,包括广度优先遍历的源代码,-breadth - first traversal, including breadth - first traversal of the source code,
genBST
- 通用二叉搜索树,包含的算法有:输出广度优先遍历、前序、中序、后序遍历结果,按树的形状打印树,统计总节点数,统计叶子节点数,统计右节点数,计算树的高度,删除所有叶子节点,插入节点,查找节点,删除节点,由前序遍历结果和中序遍历结果生成树,由后序遍历结果和中序遍历结果生成树,检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth - first traversal, the former
sting7.doc
- 图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现 图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现-the adjacency matrix, the adjacent table, Cross Chain, Listless multiple adjacent storage structure and said the creation algorithm in C Language map of the depth-first traversa
tu
- [输入] 图的顶点个数N,图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径,则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法,从顶点A开始,依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B,则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M,再访问与VA2邻接顶点...,如此下去,直至找到B,最先到达
l
- 7_4无向图深度优先生成树和广度优先生成树 数据结构算法的实现
diwuci
- 1)掌握图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现; 2)掌握图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现;