搜索资源列表
两种遍历图的方法
- 熟悉图的两种常用的存储结构,以及在这两种存储结构上的两种遍历图的方法,即深 度优先遍历和广度优先遍历。进一步掌握递归算法的设计方法。 -familiar with the plans of two commonly used storage structure, and the two storage structures on the two traverse map, that depth-first traversal and breadth priority traversal.
图的遍历
- 数据结构中关于图的遍历,任意建节点,深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods
图遍历
- 本程序用邻接矩阵实现图的深度优先遍历 图的广度优先遍历-the procedures used adjacency matrix of the plan is to achieve depth-first traversal of the plan breadth priority Ergodic
图的遍历演示
- 一. 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序,演示在连通的无向图上访问全部节点的操作。二. 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点,分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Descr iption many issues involving maps of algorithms are to traverse the map-based. A written test procedures,
广度优先遍历图
- 广度优先遍历实验报告 供初学者参考,通过对该系统的设计,可以很好的理解树的概念和用途-breadth - first traversal report experimental reference for beginners, the system design can have a very good understanding of the concept of the tree and use
广度优先遍历
- 本程序是实现广度优先遍历算法的全过程,包括图的建立,队列的建立,邻接表的建立,图的遍历等等功能。
数据结构图的邻接矩阵,邻接表存储表示,图的深度优先搜索遍历,广度优先搜索遍历
- 数据结构图的邻接矩阵,邻接表存储表示,图的深度优先搜索遍历,广度优先搜索遍历
extentreaddir
- 使用广度遍历的算法统计批定目录包括其子目录下文件的数量-Breadth traversal algorithms using statistical batch given directory including its subdirectories, under the volume of documentation
picture
- 实现图的遍历。对图的深度和广度的遍历,建立邻接矩阵与邻接表-The realization of graph traversal. To map the depth and breadth of the traverse, the establishment of adjacency matrix and adjacency list
tudebianli
- 图的遍历和生成树求解实现(邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现) -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
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程序
Broad-First-Search(AdjLGraph)
- 此代码为“图的广度优先遍历”的源代码,图的存储形式为邻接表,里面有图的邻接表存储的代码,还有广度优先遍历的算法,还有验证的主函数。-This code is " breadth-first traversal map" of the source code, Figure storage form of adjacency list, there are plans stored in the adjacent table code, as well as breadth-fi
graph.yangxu
- 熟悉图的存储方式,实现图的邻接矩阵或者邻接表的存储方式下的基本运算,特别是深度遍历和广度遍历;掌握以图为基础的一些常用算法,如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth trav
traversinggraph
- 图的遍历的实现,文字界面,包含深度遍历和广度遍历两种情况-Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~
Graph
- 对图表的储存,深度遍历,广度遍历,文件操作的源代码(For chart storage, depth traversal, breadth traversal, file operation source code)
text13
- 通过邻接表来构建一个无向图,然后分别深度遍历图以及广度遍历图(Build a graph by adjacency table, and then traverse the map in depth and breadth)
图的广度优先遍历
- 实现图的广度优先遍历程序,c语言编程,图论(A program for realizing the breadth first traversal of a graph)
图的遍历
- 图的构建以及实现图的深度遍历和广度遍历!!!!!!!!(tudegoujianyijishixiantudeshendubianliheguangdubianli)
图的遍历
- 构造图的邻接表,实现图的深度优先和广度优先算法。(Structure graph adjacency table, graph depth first and breadth-first algorithm.)