搜索资源列表
图论算法库 C++ 语言实现
- 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压
LevelOrderTraverse
- 从键盘输入二叉树的节点数据建立二叉树，然后中序遍历-keyboard input from the binary tree data to establish binary tree node, which then preorder
erchatree
- 根据数据文件内的数据对二叉树进行操作。分别完成：二叉树节点数据的插入、删除、查找和打印输出等功能。-basis of the data within the data file to binary tree operate. Completed : binary tree node data insert, delete, search and print capabilities.
xianxuxunhuan
- 二叉数先序循环的非递归实现，一般先序循环都是由递归实现的，按照完全二叉树格式输入字符型结点值-binary sequence a few first cycle of non - recursive, the general first order recursive cycle are achieved, In accordance with the format completely binary tree node input character values
Twoforktrees
- 二叉树操作,掌握指针变量的含义，二叉树的结构特征，以及各种存储结构的特点及使用范围；指针类型描述、访问和处理二叉树的运算。程序1： 按先序次序输入二叉树中结点的值（一个字符），`0`表示空树，生成二叉树的二叉链表存储结构， a为指向根结点的指针。然后按中序顺序遍历二叉树。算法思想：先访问左子树,再访问根结点,最后访问右子树。-binary tree operation, grasp the meaning indicator variables, binary tree structure, a
erchashu111
- 该程序是我的实验作业，二叉树中两结点最近的共同祖先-the procedure is experimental operation, the two binary tree node recent common ancestor
avl_tree
- 1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括\"商品编码\"、\"商品名称\",且以\"商品编码\"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为\"生成的商品\"加上商品编码 5.程序中的随
C4_5.m
- his algorithm was proposed by Quinlan (1993). The C4.5 algorithm generates a classification-decision tree for the given data-set by recursive partitioning of data. The decision is grown using Depth-first strategy. The algorithm considers all the poss
DragDropApp
- 树节点菜单的C#实例源码下载，在节点处应用于图像技术，参考价值大，C#制作的树控菜单源码实例，新手朋友，可不要错过哦。-Tree node menu C# example source code download at the nodes used in image technology, large reference value, the tree control menu source C# produced instance, novice friends, can not miss.
B-
- 三阶B-树的节点插入与删除 三阶B-树的节点插入与删除-Third-order B-tree node insertion and deletion of third-order B-tree node insert and delete
draw-tree
- 伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.-The tree is drawn in such a way that both of the edges
li
- c语言实现的数据结构中线形表的应用,包括二叉树结点的插入,删除,查询等-c language data structure in binary tree of applications, including binary tree node insert, delete, query, etc. -XIANXINGBIAOYINGYONG
bin-tree
- 二叉树类及其实现以二叉链表为存储结构实现二叉树类和成员函数， 设计计算二叉树结点、将二叉树每个结点的左右子树交换、求二叉树高度的算法-Binary tree class and its implementation to the list for the storage structure of the binary classes and member functions to achieve a binary tree, binary tree node design calculati
tree
- 遍历树,用于存储节点信息及其他查找树操作,仅供学习参考-Traverse the tree, for storing information and other search tree node operation, only to learn information
delete-AVL-tree
- 武汉大学的数据结构C++版实验，要求实现AVL树结点删除-Wuhan University' s version of C++ data structure experiments required to achieve AVL tree node to delete
binary-tree
- 该文件描述了二叉树的链式存储结构。 相关性质。结点和结点间关系的基本概念；二叉树的链式存储结构。了解树的结点访问的方法。掌握二叉树的链式存储结构； 二叉树结点的递归访问方法。二叉树的遍历。二叉树的线索化及其应用 -The document describes the Storage Structure of the binary tree. Related properties. Nodes and nodes of the basic concepts of the relat
TBinary-tree
- 统计二叉树节点的C语言描述，软件技术基础，适用于初学者。-C language descr iption of statistical binary tree node, software technology base, suitable for beginners.
TREE
- 求解二叉树见节点的最大距离，供大家学习参考-Solving the binary tree node see the maximum distance for everyone to learn! ! ! ! ! !
AVL-Tree
- AVL tree - is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one
tree-to-indented-text
- 算法实现了用缩格的文本形式表示任一树的节点数据的功能，代码简洁优化，含说明文档。-Algorithm functions with text indentation represents any tree node data, concise code optimization, including documentation.