搜索资源列表
Graph
- 图的基本操作及定义,包括深度遍历和广度遍历-Graph s basic operation and definition,Including the depth and breadth traversal.
binary-tree
- 二叉树的实现，包括深度和广度遍历等基本功能-Binary tree implementations, including traversing the depth and breadth of the basic functions
DebugALGraph
- 图的深度，广度遍历，两顶点之间的最短路径，-Map the depth, breadth traversal, shortest path between two vertices, etc.
Graph
- 数据结构，用C++实现图的深度和广度遍历，能运行。-Realize graph traversal by C++.
N-binary-tree-to-traverse
- 本程序用递归法遍历N叉树。可进行深度和广度遍历。 注： 按“/”键结束输入 如 2 1 3 / 6 / 9 / / / / 输入可得 深度遍历为21369，广度遍历为21369 最打节点个数为100个，且节点类型为字符型-This program using a recursive method to traverse N binary tree. For depth and the breadth traverse.
wuxiangtu
- 无向图的邻接矩阵实现，及广度遍历，生成最小树。-Undirected graph adjacency matrix to achieve, and the breadth traversal, generating minimum spanning tree.
Breadth
- 使用图的深度遍历实现的邻接表存储结构和基本操作函数，在此基础上实现图的广度遍历算法-The use of graph traversal depth achieve adjacency list storage structure and basic operation function, on the basis of the realization of graph breadth traversal algorithm
Graph
- 使用邻接表作为存储结构构造图，并完成图的建立，深度遍历，广度遍历-Structural map as a storage structure with the adjacency list, and complete the establishment of the Figure, deep traversal, breadth traversal
Graph(adjacency-matrix)
- 使用邻接矩阵作为存储结构构造图，并完成图的建立，深度遍历，广度遍历-Use the adjacency matrix as a storage structure structure diagram, and complete the establishment of the Figure, deep traversal, breadth traversal
CreateGraph
- 本程序实现了数据结构中图的基本创建方法...以及图的深度遍历和图的广度遍历-This program to achieve data structure of Chinese basic and establish ways... And the depth of the graph traversal graph and breadth of traverse, etc...
graph
- 数据结构--图的相关操作java实现，图的深度遍历和广度遍历。-Data structure-a figure related operations Java implementation ，The depth of the graph traversal and breadth traverse
DFS_BFS
- 中山大学软件工程大一数据结构，邻接矩阵深度和广度遍历。-Sun Yat-sen University Software Engineering freshman data structures, the adjacency matrix of the depth and breadth traversal.
Graph-traversal
- 该文件描述了数据结构中图的遍历的两种方法，广度遍历和深度遍历，能让你对其有基本的了解-The document describes two methods of data structures, graph traversal, breadth traversal and depth of traversal, allowing you to their basic understanding of
mgraph
- 数据结构，图储存结构的算法，包括深度遍历，广度遍历等-Data structure, storage structure of the algorithm
Map
- 对图的各种操作，包括深度遍历，广度遍历，最小生成树，最短路径的各中算法，而且有递归和非递归方式，对学习数据结构有很大的帮助。 代码全是自己根据理解自己写的，思路很符合初学者。-Various operations on the map, including the traverse depth, breadth traversal, minimum spanning tree, shortest path in the algorithm, and recursive and non rec
Tree
- 对树的各种操作，包括二叉排序树，其中通过先序遍历和中序遍历构造二叉树，以及深度遍历，广度遍历，层度遍历，以及删除二叉排序树的某一个节点的操作。对学习数据结构有很大的帮助。-Various operations on the tree, including the binary sort tree, the first traversal and traversal construct a binary tree, as well as the depth of the traversal, br
Graph-traversal
- 图的遍历，图的深度递归遍历算法，深度遍历非递归算法，图的广度遍历-Graph traversal.The depth traverseof the graph including recursion algorithm or not and breadth traverse of the chart.
fei
- 邻接矩阵转为邻接表,功能已经全部实现。并且广度遍历也实现了。-Adjacency matrix into the adjacent table, the function have all been achieved. And breadth traversal is also achieved.
erchashu.c
- 对二叉树进行创建，寻找父节点，子节点，同时进行广度遍历-Create a binary tree to find the parent node, child nodes, while the breadth traversal
bianli
- 图的深度及广度遍历 首先创建一个无向图,顶点用一个一维数组存储,弧用一个二维数组存储,不相邻顶点之间设置无限大。深度遍历时设置顶点的布尔函数，访问过的顶点布尔值为true，递归调用DFS函数。广度遍历时，结合队列的存储方式，进行遍历。-Figure traverse the depth and breadth of First create a non-directed graph, vertex with a one-dimensional array to store the arc w