搜索资源列表
EyesCare
- 程序主要是利用计算机图形学中的分形技术画出一棵树，然后实现树的忽大忽小，忽远忽近，而树的背景不变。运行程序后，按Esc键即可退出。-Program is the use of computer graphics technology to draw a fractal tree, and then realize the tree suddenly suddenly small, suddenly away suddenly near, and trees in the background u
Huffman
- 哈夫曼编码设计 掌握树和二叉树的概念及工作原理，运用其原理及概念完成上述实验题中的内容。 -Huffman trees and binary code design to grasp the concept and principle, to use its principles and concepts in the above experiment of the content.
202110338
- 数据结构C++树类中求最后一个孩子结点并输出-Trees and seeking the last child node
huffman-tree
- 数据结构，树，哈弗曼树。带权路径长度最小的二叉树-Data structures, trees, Huffman tree. Minimum weighted path length binary tree
Billboard
- 用广告牌技术实现树木（2D）的3D效果，用到摄像机漫游（Directx3D）-Technology with billboard trees (2D) 3D effect, use the camera roaming (Directx3D)
func_SPIHT_Main
- SET PARTITON INTO HIERARCHIAL TREES:IT IS THE GENERALISATION OF THE EZW ALGORITHM IN A MANNER THAT TENDS TO KEEP INSIGNIFICANT COEFFICIENTS TOGETHER IN LARGER SUBSETS
BiTree
- 二叉树的相关操作，包括二叉树的先序、中序、后序遍历以及其中结点的插入和删除-operations on Binary Trees
DecisionTreeYSD
- 决策树的Matlab实现，实现了分类问题和回归问题，有很好的调试结果-Matlab implementation of decision trees
js_trees
- 各种树形菜单特效，包括上下 左右 弹出 滑动等效果-javascr ipt trees
algorithm-CPP
- 数据结构面试常考算法，C++实现 包含数组、字符串、链表、二叉树、排序-Interview data structures algorithm, C++ contain arrays, strings, linked lists, binary trees, sorting
lisanshiyan
- 大二学年离散数学实验，运用c语言编写对离散数学这门课中关于树、图等的运算的程序-Discrete mathematics sophomore year experiment, using c language for this course on discrete mathematics trees, graphs, etc. Operational procedures
Huffman
- 用mfc完成的哈夫曼树的功能 给出一组关键字，建立哈夫曼树，完成以下功能： （1）完成关键字来自于输入 （2）完成关键字来自于文本 （3）完成编码，显示编码结果 （4）画树-Completed using mfc Huffman tree function gives a set of keywords, the establishment of the Huffman tree, complete the following functions: (a) completio
mileluobin
- 简单的米勒罗宾大素数测试64位代码。没有大树的调用。只能实行64位。供大家分享。-Robin Miller, a simple test large prime numbers 64-bit code. No trees called. Can only implement the 64. For everyone to share.
planttree
- 一条街的一边有几座房子。因为环保原因居民想要在路边种些树，路边的地区被分割成块，并被编号成1..N，每个部分为一个单位尺寸大小并最多可种一棵树，每个居民想在门前种些树并指定了三个号码B,E,T，这三个数表示该居民想在B和E之间最少种T棵树。当 然，B≤E,居民必须记住在指定区不能种多于区域地块数的树，所以T≤E-B+l。居民们想 种树的各自区域可以交叉。你的任务是求出能满足所有要求的最少的树的数量。 -One side of the street there are several
AVLTree
- AVL 树是平衡二叉搜索树，所以首先 必须满足搜索树，即l_child值<parent值<=r_child值。这个在前面已经实现了。插入和删除不停的递归就可以。-Two AVL tree is balanced binary search trees, so we must first meet the search tree, l_child value and <parent value of <=r_child value. The in front has bee
tree
- 算法与数据结构中的二叉树，孩子-兄弟存储的树，二叉线索树，最优二叉树，哈夫曼树等）。-Algorithm and data structure tree, children- brothers storage tree, binary tree trail, optimal binary tree, Huffman trees, etc.).
BinaryTree
- 完整二叉树类的实现(包含测试文件)功能涵盖建树、删除左右子树、归并两棵树、二叉树的前序、中序、后序及层次遍历-Complete binary tree class implementation (including test files) function covers achievements, left sub-tree delete, merge two trees, binary tree preorder, inorder, and postorder traversal level
newTree
- OpenGL技术，通过正弦函数刻画点画3D树显示，c#语言源程序-OpenGL technology, 3D trees dotted portrayed by a sine function display, c# language source
HaffumanCode
- 构造一棵哈夫曼树，并棵从上自下或从下自上对每个子叶编码-Huffman tree structure, and from the bottom or from the trees down from the coding from each cotyledon
binary tree,Quick sort, Heap Sort
- binary tree,Quick sort, Heap Sort C programs