搜索资源列表
qishi
- 图算法之骑士遍历问题,骑士遍历问题,或者象棋中马的遍历问题-Knight traversal, or chess problem in ergodic horse
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
erchashubianliywc
- 只要就是用来实现二叉树遍历的功能,用c++语言实现的,是比较精简的数据结构。-erchashu bianli gongneng
create_graphic
- 图的建立,有多种的图可以选择,也可以选择图的遍历方法,里面的图的存储结构是以顶点数组和邻接矩阵的方式存储的。-Map-building, there are several plans to choose, you can choose to graph traversal method, which the storage structure of the plan is based on vertex adjacency matrix of the array and stored the.
graphic_vist
- 图的遍历,里面也包括图的建立,有各种形式的图可以选择,符合多种需求。-Graph traversal, which also includes the establishment of plans, there are various forms of plans to choose, consistent with a variety of needs.
erchashu
- 数据结构二叉树的遍历 例如 输入abc..de.f..g... 输出其先序遍历中序遍历后序遍历-例如 输入abc..de.f..g... 输出其先序遍历中序遍历后序遍历
zhongxubianli
- 二叉树生成及遍历。以某种形式建立二叉树逻辑结构信息,建立二叉链表,先作先序、中序、后序遍历,将二叉树中序线索化,中序遍历线索二叉树-Tree generation and traversal. Some form of information to establish the logical structure tree, the establishment of binary list, to make the first order, in sequence, after the trave
DataStructureCourseDesignBinaryTreeTraversal
- 一个非常经典的原创的数据结构课程设计--二叉树的遍历-相信大家非常xihuan -A very classical structure of the original curriculum design data- Binary Tree Traversal- I believe we are very xihuan
java3
- 二叉树的定义, 编写一个main方法, 实现二叉树的中序和后序遍历,实现二叉树遍历 改编的方法-The definition of binary tree, write a main method, in order to achieve the binary tree and post-order traversal, the realization of binary tree traversal method adapted
Graphtraversal
- 图的遍历的代码和设计报告图的遍历的代码和设计报告-Graph traversal of the code and design report
shujujiegou
- 实现对任意给定的二叉树(顶点数自定)建立它的二叉链表存贮结构,并利用栈的五种基本运算(置空栈、进栈、出栈、取栈顶元素、判栈空)实现二叉树的先序、中序、后序三种遍历,输出三种遍历的结果。-Any given realization of the binary tree (self-Vertices) the establishment of its chain store binary structure, and use the five basic computing stack (The s
bianli
- 网络游戏外挂开发代码示例,遍历怪物源码,遍历当前场景中的所有怪物。-Plug-in development, ergodic source monster
bitree
- 数据结构完成二叉树遍历,包括递归和非递归-Complete binary tree data structure traversal, including recursive and non-recursive
tubianli
- 数据结构中课程设计,图的遍历,环境Visual C-Data structure in curriculum design, graph traversal, environmental Visual C++
GraphTraversal
- 图的遍历,实现图的深度和广度两种便利方式,方便快速。-Graph traversal, the realization of the depth and breadth of plans to facilitate the two way quickly and easily.
shujujiegou
- a.HUFFMAN树及HUFFMAN编码 任务:由用户输入n个结点权值,建立HUFFMAN树并输出HUFFMAN编码。 b.二叉树建立及相关算法实现 任务:按照广义表表达法建立二叉树,并实现二叉树的层次、先序、中序与后序遍历,以及输出树中叶子结点的结点值及叶子结点的个数。( 用递归或非递归的方法都可以) 要求能够输入树的各个结点,并能够输出用不同方法遍历的遍历序列;分别建立创建二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数、输出后序遍历序列的函
BiTree
- 二叉树的实现,实现创建二叉树,遍历二叉树,删除节点等-the development of Bitree
dirtotreeview
- Delphi 递归遍历目录到树的源码,很经典的源码-Delphi recursive traversal of the source directory to the tree, it is the classic source
win32filefind
- 在WINDOWS平台下.用VC++编写的遍历文件 -brows the files
DFS
- 标准的深度优先搜索算法,可实现节点遍历、产生随机路由、检测图中是否有回路等功能,-Standard depth-first search algorithm, the node traversal can be achieved, resulting in a random routing, testing whether there is any loop diagram functions