搜索资源列表
_
- 图运算 在邻接矩阵存储结构上实现图的深度和广度优先遍历算法-Figure computing adjacency matrix storage structure diagram of the depth and breadth-first traversal algorithm
linjiejuzhen
- 能够输入输出一个图的邻接矩阵，能够对相应的边和顶点进行插入删除操作，能够进行深度和广度优先搜索遍历-The adjacency matrix of a graph can be input and output, insertion and deletion operations to the corresponding edges and vertices, depth and breadth-first search traversal
062
- 有向图的邻接表存储表示，并进行深度和广度优先遍历-To the adjacency table storage, and the depth and breadth-first traversal
Binary-Tree
- 对二叉树进行操作，包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
graph
- 数据结构，建立图，实现图的深度和广度优先搜索，最小生成树，最短路径-Data structure, the establishment figure, to achieve the depth and breadth-first search, minimum spanning tree, shortest path
graph
- 图的深度递归与非递归遍历，广度优先搜索遍历。VC6.0-Figure recursive and non-recursive traversal depth, breadth-first search traversal.
tudejianlijibianlifangfa
- 1．要求对于给定的图分别用邻接矩阵和邻接表来存储。 2．对于存储好的图进行深度和广度优先遍历。 3．完成图的各种操作。 - 1. Requirements for a given graph adjacency matrix and adjacency were used to store the table. 2. Good depth chart for storage and breadth-first traversal. 3. Complete dia
software-design-I
- c++实现的非常详细的数据结构与算法代码，队列，链表，三元组，哈弗曼树，树的各种递归，非递归遍历算法，树与森林相互转化算法，图的深度，广度优先搜索算法，双连通算法，强连通算法，拓扑排序算法，最短路径算法，哈希，快速排序，归并排序等等。-C++ very detailed data structure and algorithm code, queues, linked lists, three tuple Havermann tree, various recursive tree, non r
Common-algorithms-classic-code
- 数据结构中介绍的常见经典算法，排序、二叉树深度、广度优先搜索、高精度加减乘除等-Common data structures described in the classical algorithms, sorting, binary tree depth, breadth-first search, high-precision addition, subtraction, etc.
map
- 非常经典的 图的深度和广度优先遍历，可以下载一下学习学习-The depth and breadth very classic graph traversal priority, learn what you can download