搜索资源列表
3-OptimalBinaryTree
- 最有二叉搜索树生成程序，图形界面演示，VC6.0开发-most binary search tree formation process, a graphical interface presentations, the development of VC6.0
MCMProjects
- 我备战2010数学建模美赛所精心准备的算法资料，一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现，来解决一个问题。其中一些是自己编写，其它的也是由网上找到后经过修改编译通过的。比赛结果还不错，一个M，现在把资料共享出来，希望对大家有所帮助，算法主要有模拟退火，遗传算法，蒙特卡罗算法，蚁群算法，粒子群算法，元胞自动机，Dijkstra，最小生成树算法，二分图最大匹配算法，最大流算法，动态规划算法，分支定界法，排队论算法，决策论算法等，我写了个说明文件，列的挺详细的-I a
huffman
- 赫夫曼压缩解压代码C++编译。VC6环境下运行~采用二叉树结构-Huffman compression decompression code C++ compiler. Run under VC6 binary tree structure ~
binarytree_traversal
- 本程序是基于VC6.0的二叉树遍历程序，程序代码清晰明了，本程序主要是实现二叉树的中序遍历，包括递归和非递归两种，对于数据结构中二叉树的学习有很大帮助。-This procedure is based on the binary tree traversal program VC6.0, code clarity, this program is to achieve binary tree inorder traversal, including both recursive and non
dyObst
- 使用动态规划算法实现的最优二叉查找树问题，算法基础中的基本算法。使用vc6.0进行编译-Dynamic programming algorithm using the optimal binary search tree problem, the algorithm based on the basic algorithm. Compiled using vc6.0
Huffman
- 哈夫曼树 用vc6.0编写的哈夫曼树 -Huffman Huffman tree, the tree prepared by vc6.0
bi-tree
- 递归中序遍历二叉树，Windows环境，vc6.0-Recursive inorder traversal binary tree, Windows environment, vc6.0
Huffman
- 利用哈夫曼树对asc码文件进行编码 压缩解压 VC6.0编的-Use Huffman code tree for the asc file encoding decompression VC6.0 compiled
Huffman
- 霍夫曼编码，生成霍夫曼树。用VC6.0编译，控制台应用程序-Huffman coding, Huffman tree generated. With VC6.0 compiler, a console application
ThreadBinTree
- 二叉树的线索化，先建立一棵二叉树，然后再进行线索，在Win32 VC6.0下编译通过-Threaded Binary Tree
Huffman-vc6.0
- 哈夫曼树，学数据结构的小朋友可以参考一下-Hoffmann tree, learn of data structure children can consult
AVL_tree
- AVL树数据结构的实现，环境是vc6.0-Implement AVL tree in vc6.0
5.21DFS
- 深度优先搜索实现的二叉树深度判断，源码在vc6.0下编译通过。-DFS searching to measure the depth of the binary tree.and the code is compilled successfully in VC6.0.
deep-first-searching
- 深度优先搜索实现的二叉树深度测量，源码在vc6.0下编译通过，运行稳定。-DFS searching to measure the depth of the binary tree.and the code is compilled successfully in VC6.0.
erchaSHU
- 在VC6.0中 对二叉树的实现 是数据结构与数据库里面的知识 -The realization of the binary tree
the-static-binary-tree-and-input
- 建立一个静态二叉树，并对他进行先序遍历，已在vc6.0上运行通过。-To establish a static binary tree, and carries on his first sequence traversal, has run through in vc6.0
rrt_simplify
- 在VC6.0上实现了简化的快速扩展随机树算法，实现了人工放置起点，终点和障碍点。算法自动生成避开障碍的路径。注释详细，具有较好的参考价值。- a simplified algorithm of fast expanding random tree in VC6.0 is implemented, and the starting point, end point and obstacle point of artificial placement are realized. Algorithm
bt
- 大学数据结构课程实验之二叉树。vc6.0环境。-The experimental binary tree of university data structure course. Vc6.0 environment.