搜索资源列表
1
- 利用邻接表存储无向图,并深度遍历和广度遍历图-Storage without the use of the adjacent table to the map, and the depth and breadth traversal graph traversal
group
- 建立一个图结构，并对其进行深度遍历和广度遍历，输出结果-The establishment of a map structure, and its depth and breadth traversal traversal, output
erchashu
- 本文利用C语言实现了简单的二叉树，每个结点只保存一个整数，并且，由于非常简单，树的根结点是确定的，而不是输入的。确定根结点以后，用户输入的每一个数都被insert到树中（-999表示停止），利用深度优先的方法。建立好二 叉 树以后，分别利用深度优先（DFS）和广度优先（BFS）进行了遍历，输出结果。-In this paper, the use of C language realization of a simple binary tree, each node only maintains
tree_xml
- 分析XML文件并提取关键字和数据的过程，使用深度遍历及广度遍历。-Analysis of XML file and extract the keywords and data in the process, using the depth and breadth traversal traversal.
Cpp2
- 建立无向图和有向图，实现图的深度遍历和广度遍历。-The establishment of an undirected graph and directed graph to achieve the depth graph traversal and breadth of the traverse.
graph
- 数据结构实验：用C语言求解图的深度遍历和广度遍历-Experimental data structures: Using C language to solve graph traversal depth and breadth of the traverse
Graph
- 通过深度和广度遍历 实现对图各节点的遍历算法-Achieved by traversing the depth and breadth of the graph traversal algorithm for each node
tu
- 图的操作 1.邻接法创建图 2.输出建立的图 3.求各顶点的度 4.深度遍历图 5.广度遍历图 6.退出程序-Figure 1 operation. Neighbor joining to create Figure 2. Output created Figure 3. Seek the vertices of degree 4. Deep traversal Figure 5. Breadth traversal Figure 6. Exit
graph2
- 输入图的顶点和边，可以选择对图进行深度或者广度遍历。-Input graph vertices and edges, you can choose the depth, or breadth of the graph traversal.
tudebianli
- 图的深度遍历和广度遍历（以邻接表为存储结构）-The depth and breadth traversal graph traversal (in the adjacent table for the storage structure)
AdjacencyMultilist
- 这是个图的深度和广度遍历算法，主要是巩固数据结构的内容，对人启发非常大-This is a graph traversal algorithm for the depth and breadth of the main contents of the consolidation of data structure, inspired by a very large human
graphic
- 数据结构中图的构造，以及深度遍历和广度遍历的C语言实现-Data structure in the structure, and the depth and breadth traversal traverse the C language
graph
- 以邻接矩阵或是邻接表作为存储结构建立一个无向图，进行深度或广度遍历，输出遍历序列-Adjacency matrix or adjacency list to store the structure as a undirected graph, the depth or breadth traversal, output traversal sequence
tu
- C练习作业：图 深度遍历，广度遍历，最小生成树，拓扑排序-C Exercise job: Figure depth traversal, breadth traversal, minimum spanning tree, topological sort
shujujiegoua
- 数据结构里面基本所有的知识点的代码为全班同学的作业如约瑟夫问题、哈弗曼编码、层次二叉树、深度广度遍历-Data structure inside knowledge of the basic points of all the code for the whole class of operations such as Josephus problem, Ha Fuman coding, hierarchical binary tree, depth, breadth traversal
Map22
- 一个基于VC的有向无环图操作实例源代码，图的节点可以使任意可插入OLE项，在编辑一栏，您可以插入节点、删除节点、拓扑排序、广度遍历、最短路径、插入边等操作，该程序作者是中国地质大学的姜景捷。 -A VC' s are based on directed acyclic graph operation source code examples, graph nodes can be inserted into OLE can make any entry in the Edit colu
ShortestPathMaze
- 使用广度遍历的方式寻找迷宫中的最短路径。-Traverse using the breadth of the way to find the shortest path maze.
wq
- 校园导游系统，显示校园的所有景点，并完成所有景点的深度遍历，广度遍历及各景点详细信息的查询-Campus tour guide system, showing all the attractions on campus, and complete all the attractions of the depth of traversal, breadth of information traversing the query and the Attractions
Graph-traversal
- 图的遍历，深度遍历和广度遍历，数据结构，图的遍历！ -Graph traversal, depth and breadth traversal traversal, data structures, graph traversal!
Lying-data-structure9
- 《大话数据结构》主要内容包含：数据结构介绍、算法推导大O阶的方法；顺序结构与链式结构差异、栈与队列的应用；串的朴素模式匹配、KMP模式匹配算法；二叉树前中后序遍历、赫夫曼树及应用；图的深度、广度遍历；最小生成树两种算法、最短路径两种算法；拓扑排序与关键路径算法；折半查找、插值查找、斐波那契查找等静态查找；稠密索引、分块索引、倒排索引等索引技术；冒泡、选择、插入等简单排序；希尔、堆、归并、快速等改进排序-" Westward the data structure," the m