搜索资源列表
经典cpp例子
- 这几个是本人整理的.cpp程序，您可以借鉴参考------>> dos前景背景色设置.cpp 二．八．十．十六进制转换程序的函数.cpp 二叉树的遍历.cpp 图形的广度优先搜寻法.cpp 图形的深度优先搜寻法.cpp 用C语言编的一个日历.c-these are my finishing. Cpp and you can draw reference --- gt; Gt; Dos prospects for the background color set. Cpp two. 8
T_E.rar
- 将前缀表达式转为中缀表达式，并画出所建的树,To prefix infix expression to expression, and draw the tree built
xiaobobaofenjie
- 本程序重构各层低频和高频系数，画功率谱，横坐标为频率，纵坐标为功率，小波包分解最后一句是为显示小波包四层分解树结构-Reconstruction of the procedural layers of low and high frequency coefficients, draw power spectrum, the abscissa is the frequency, the vertical axis is power, wavelet packet decomposition is
huffman
- 一份huff_tc.c，只能在tc下运行，因为加入了用tc图形界面直观画出树形的代码。一份是huff_vc.c,是在vc和tc下都能运行的程序，没有直观表达编码的树形结构。 [目的] 构建所输入符号（及权值）的哈夫曼树，并利用该树求出各符号的编码，深入理解最优二叉树的概念及其特性。 [问题描述] 读入各个符号及其权值，求各符号的哈夫曼编码。 [基本要求] （1）读入各个符号及其权值，建立哈夫曼树； （2）利用建立的哈夫曼树对各符号进行编码，输出编码结果。 [
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
Huffman
- 进行Huffman的编码以及译码。而且有画出Huffman编码的树-For Huffman coding and decoding. But also draw Huffman coding tree
daima
- 用最小生成树的方法来求解最短的送货路径，并画出生成树图形-With the minimum spanning tree method to solve the shortest delivery path and draw spanning tree graph
VCfenxing
- 递归实现分形，用VC画一颗树，外型类似柏树。足见递归是如此消耗内存，并且看到神奇的分形理论-Recursive Fractal, VC draw a tree, shaped like cypress. Recursive memory consumption is so evident, and see the magic of fractal theory
Prime
- Prime算法生成最小生成树，使用GDI+将最小生成树画出-Prime algorithm to generate minimum spanning tree, minimum spanning tree to use GDI+ to draw
erchashu
- 假设一颗二叉树的先序序列为EBADCFHGIKJ和中序序列为ABCDEFGHIJK，请画出该树-Assuming a binary sequence of the first order and the order for the EBADCFHGIKJ sequence ABCDEFGHIJK, please draw the tree
treenode
- 画出一棵二叉树，写出按照initial()函数建立该二叉树的字符序列。编写一个程序能建立一棵二叉树，并求所有叶子及结点总数。-Draw a binary tree, write in accordance with the initial () function to establish the sequence of characters of the binary tree. Write a program to establish a binary tree, and ask all th
good
- 深度优先和广度优先搜索序列，并画出所得到的深度优先生成树以及广度优先生成树。假设选择原则是按字母从小到大排列-Depth first and breadth first search sequence, and draw the depth of the get priority spanning tree and breadth first spanning tree. According to the principle of choice is that since the arrange
tree
- 哈夫曼树，可以图形显示,是用vc++编写的课程设计，-huffman tree，it can be described by draw
MINTREEK
- Kruskal生成最小树算法，可以画出最小树-Kruskal generate a minimum spanning tree algorithm, can draw a minimum spanning tree
BinaryTreeIterate
- 已知中序和后序遍历，求前序遍历.比较笨的方法是画出来二叉树，然后根据各种遍历不同的特性来求，也可以编程求出.-Known inorder and postorder traversal, seeking preorder traversal. Stupid way is to draw out the binary tree, and then iterate based on a variety of different features to find, but also can be pr
mintree
- 最小生成树源代码，给定一个邻接矩阵，可以画出一个最小生成树的图-The minimum spanning tree of source code, given an adjacency matrix, can draw a minimum spanning tree of a graph
HuffmanCoding
- 这是使用Matlab实现的Huffman编码与绘图的程序。编码过程比较简单，是通过建立Huffman树，再进行简单的遍历得到。 主要贡献在绘图部分。这是迄今为止唯一一个画出Huffman生成树的Matlab程序。-This is a piece of Huffman coding and graphics program based on matlab. The encoding process is relatively simple, through the establishment of
draw-boundary
- Drawing boundary for decision tree algorithms
Ch03
- 实现决策树的构建，在Python中使用matplotlib注解绘制(Implement the construction of the decision tree, used in Python, matplotlib annotation draw)
Q1
- 用matlab求解最小生成树，并绘制示意图(Use Matlab to solve the minimum generation tree and draw a schematic diagram)