搜索资源列表
perl_misc
- 对文件或目录的操作函数模版.根据对目录的分析结果对目录进行深度或广度遍历从而操作文件(或目录)-right file or directory operation function templates. Based on the analysis results directory of directories depth or breadth traversal thus operational documents (or directory)
123
- 在Borland C++ Builder 实现 图的深度和广度遍历
fenjiu
- 程序利用深度广度遍历的思想实现分酒问题,分酒问题描述详见程序头
picture
- 实现图的遍历。对图的深度和广度的遍历,建立邻接矩阵与邻接表-The realization of graph traversal. To map the depth and breadth of the traverse, the establishment of adjacency matrix and adjacency list
datastructure
- 非递归创建二叉树.并且用非递归算法实现对二叉树的前序、中序、后序和广度遍历。 实现语言:C-Create a binary tree non-recursive. And the use of non-recursive algorithm for binary tree of the former order, in sequence, after the traversal sequence and breadth. Implementation language: C
migongsuanfa
- 将从迷宫入口到各点的最短路近的集合看作一棵树。用广度遍历 的方法即可找到出口的最短路近。本程序算法思想来源于求图上一点 到其余各点最短路近的Dijkstra算法。-Maze from the entrance point to the most recent collection of short circuit as a tree. Breadth traversal methods used to find the shortest path near exports. Algo
graph
- 图的遍历 能实现深度 广度遍历 还有文挡-Graph traversal to realize the depth of breadth traversal also text block
wxtbl
- 利用邻接表存储无向图,并深度遍历和广度遍历图-Use adjacency list stored undirected graph, and the depth and breadth traversal graph traversal
breadth_first_search
- 通过广度优先算法,遍历网络中的每个结点,得到遍历结点的时间-Through breadth-first algorithm, network traversal each node, the node traversal time
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
tu
- 以邻接表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列。 -To the adjacent table for the storage structures, to achieve connectivity of undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, respective
tudebianli
- 图的遍历包括深度优先搜索和广度优先搜索,大家可以看看。-Graph traversal, including depth-first search and breadth-first search, we can look at.
main
- 采用邻接矩阵表示无向图,完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型,图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示: Input Format: 第一行输入两个值,第一个是图中顶点的个数,第二个是图中边的条数 第二行输入各顶点的信息,即输入每个顶点字符 第三行开始输入每条边,每条边的形式为两个顶点的序号,中间以空格隔开,输入完一条边换行 Output format: 首先输出图的顶点信息,输出完毕换行 接着输出图的邻
Traversing_Graph
- 树的邻接表表示和邻接矩阵表示,以及图的广度优先和深度优先遍历。-Tree adjacency list representation and adjacency matrix representation, and the graph breadth-first and depth-first traversal.
017
- 建立图的邻接表,输出图的邻接表,深度优先遍历,广度优先遍历-CreateGraph,OutputGraph,DFSTraverse, BFSTraverse
text13
- 通过邻接表来构建一个无向图,然后分别深度遍历图以及广度遍历图(Build a graph by adjacency table, and then traverse the map in depth and breadth)
ConsoleApplication1
- 实现图的广度优先遍历,利用结构体指针,非常适合数据结构初学者。(Breadth first traversal of Graphs)
sy10(1)
- 图的存储结构与遍历 (1)画出如图(1)所示无向图的邻接矩阵和邻接表,列出该图的广度优先遍历和深度优先遍历结果(选定A为出发点进行遍历)。 (2)画出如图(2)所示有向图的邻接矩阵和邻接表,列出该图的广度优先遍历和深度优先遍历结果(选定A为出发点进行遍历)(The storage structure of the graph and traversal (1) draw the adjacency matrix and adjacency list of the und
图的遍历
- 构造图的邻接表,实现图的深度优先和广度优先算法。(Structure graph adjacency table, graph depth first and breadth-first algorithm.)
图的遍历。
- 7、无向图,根据任意一个初始顶点,输出图的深度优先搜索遍历路径和广度优先搜索遍历路径。