搜索资源列表
VC源码
- 包括编译程序词法分析器、操作系统进程状态切换演示、VC_哈夫曼树halftree、节点矩阵最短路径guildmap、串基本操作的演示-Including the compiler morphology analyzer, the operating system advancement condition cut demonstration, VC_ Haveman sets up halftree, pitch point matrix most short-path guildmap
二叉树操作&图的遍历操作
- 二叉树操作&图的遍历操作， 完全按照里面的文挡用VC所完成的程序， 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in
求树高
- 数据结构中求二叉树树高的VC实现，其中包括了二叉树的建立过程-data structure for the binary tree height VC, which included a binary tree building process
递归中序遍历排序二叉树
- 这是一个中序遍历二叉树的VC实现，要注意的是输入节点后，以－1结束-which is a binary tree traversal sequence VC, to pay attention to the input nodes, in the end -1
binary DecisionTree
- 用VC＋＋写的二叉决策树执行程序。修改修改就可以用。-with VC + + to write the two forks Decision Tree implementation procedures. Amendments can be amended on.
传教士和野人过河
- 在VC的环境下，用C++编程实现人工智能中的A*树的搜索算法，得到一个最优的过河方案。-in VC environment, the C programming AI * A tree search algorithms, to be an optimal program of the river.
spatialindex.vc
- 多维索引的多个结构的常用算法，如R树的插入删除修改，又如四叉树的插入删除修改等-Index multidimensional structure of a number of commonly used algorithms, such as the R-tree insert delete changes Again quadtree insert the revisions delete
数据结构_用VC编写_二叉排序树
- 这是用vc编写的二叉树排序算法 希望大家多给意见 是数据结构的一种算法-vc prepared by the binary tree algorithm to hope everyone is a data structure algorithms
btree_Vc
- 用VC++，实现B树算法的一个示例。 包括B树的插入、删除等功能。-VC, B-tree algorithm to achieve an example. B tree insertion, deletion capabilities.
AdaptiveHuffman
- 自适应huffman编码，即在编/解码过程中根据已编/解码数据来计算各个码字的概率，并动态调整huffman树。包括编码器和解码器。 在vc++.net 2003下开发-adaptive Huffman coding, that is the encoding / decoding process based encoding / decoding data to calculate various code word probability, Dynamic adjustment and
ecstphfm
- 这是数据结构基础算发知识的VC实现 如二叉树遍历、拓扑排序、哈夫曼树等-This data structure is based on the operator's knowledge of VC as binary tree traversal, topological sorting, Huffman tree;
vc++c4.5
- 基于vc的决策树的分类算法是ID3算法的演变-vc on the decision tree classification algorithm is the evolution ID3 algorithm
qujianshu
- 本实验完成的功能是给定一个区间找出其区间树 开发环境采用VC-completion of this experiment is to the function of a set interval interval tree to identify its development environment using VC
二叉树
- 二叉树算法！ ＶＣ＋＋６．０下开发～！-binary tree algorithm. Under VC++6.0
最优二叉搜索树
- 算法设计的动态规划中的最优二叉搜索树问题，是用VC＋＋编写的-algorithm design of dynamic optimal planning of two forks search tree problem by using VC + + prepared
决策树的 C4.5
- 决策树的 C 4.5 Vc++实现的
tree
- 数据结构二叉树算法的应用，VC环境下运行可通过-Binary tree data structure of the application algorithm, VC environment to run through
Huffman
- 用vc++实现用最短路径查找哈弗曼树。n个权值构成n棵二叉树的集合F={T1, T2, …, Tn}，其中每棵二叉树Ti中只有一个带树为Ti的根结点。-Achieved with the vc++ to find the shortest path tree Havermann. n-weight constitutes a collection of n binary trees F = (T1, T2, ..., Tn), which is only a Ti binary Each spe
Binary-tree-VC
- 建立一棵二叉排序树并对它进行前序遍历。建立二叉树利用了插入算法，数据由用户输入；对二叉树前序遍历，利用非递归调用子程序，然后对二叉树（1）访问根结点；（2）遍历左子树；（3）遍历右子树。程序中要注意左右指针llink和rlink的使用。-Create a binary sort tree and pre-order traversal. The establishment of the binary tree to the use of the insertion algorithm, the
maintenance-of-of-binary-tree-VC
- 实现二叉排序树维护子系统实现，实现查找、插入、删除、修改操作。首先要建立一棵二叉排序树，建立树根，然后按照中序遍历依次建立二叉排序树。运用switch的四个case实现各个操作，每个case中调用相应的子程序。子程序是选择要进行的操作：查找、插入、删除、修改。-Binary sort tree maintenance subsystem to achieve, to achieve the find, insert, delete, and modify operations. First ne