搜索资源列表
DSAAcodes
- 《数据结构、算法与应用》从C++语言应用角度列举了要点，以大量示例实现了表、树、图数据结构，最后实证了各种典型算法。以标准C++语法，模板化设计，符合软工思想。此内容为源码。-"data structures, algorithms and applications" from the perspective of C language application listed on the main points, a large number of examples to a
用VB设计djsdkj播放器
- 看见开会连脚裤立刻了看见环境看见开会计划看见立刻嘉陵江棵；了；立刻；立刻；看来；立刻；了；看见可怜见可怜见看来 -see even met pants legs to see immediate environment to see a meeting immediately to see plans Jialingjiang trees; ; Immediately; Immediately; It appears; immediately; ; see it Gelianjian Gelia
识别物体modify
- 统计灰度图象二值化后不连通区域的像素树木和中心位置-statistical gray image after two values not connected region trees and the pixel center
回溯法搜索排列树算法园排列问题
- 回溯法搜索排列树算法园排列问题,算法设计与分析课程，作业题-search with backtracking algorithms park with trees, algorithm design and analysis courses, and that operations
cooltree
- 此为创建若干树空间的源程序，用户可以 创建自己风格 的空间-this for a number of trees to create space for the source code, users can create their own style of space
新c++我们的呀
- 按时org,开放的网络天书! 基数排序是这样实现的: 假设需排序数列的取值...如果化成比较树可以知道,这样的排序算法复杂度的下限是O(N*lnN),而基数排序没有比较元素,所以所需排序时间就少了,我们... www.cnic.org/wiki/鍩烘暟鎺掑-time org, open network hieroglyphics! Sort base is achieved : a few assumptions need to sort out ... If the value into
排序算法、字典和B-树的C++语言实现
- 排序算法、字典和B-树的C++语言实现 代码内容 包括以下算法： qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert sort shl.c sort: shell sort has.c dictionary: hash tables bin.c dictionary: binary tree rbt.c dictionary: red-black trees skl.c dic
m_数据结构
- 数据结构测试程序，包括队列、树、哈夫曼树等内容-data structure testing procedures, including Queue, trees, and Huffman tree etc.
SPLAY
- The program SPLAY is a pascal to C translation of a program that Kim Kokkonen wrote in Turbo Pascal to implement Splay Trees. This program compresses and decompresses files, and does a pretty good job of it. Contents: SPLAY.PAS Or
200561673082201
- DES,MD5,ZLIB算法源代码 文件列表： Adler32.cpp ArithDLL.cpp ArithDLL.def ArithDLL.dll ArithDLL.dsp ArithDLL.dsw ArithDLL.h ArithDLL.lib ArithDLL.ncb ArithDLL.opt ArithDLL.plg Arithzxz.h Arithzxz.h.BAK Compress.cpp CRC.cpp Defla
shortpath-ron
- C实现二叉排序树的各种算法,了解数据结构中的树。-C fork order to achieve two tree algorithms, understanding of data structure of the trees.
TreeBillboard
- 在vc++6.0环境下，利用directx写billboard的例子，利用billboard技术在场景中绘制了两颗树。 -in vc 6.0 circumstances, the use of DirectX write Bobbi example, the use of Bobbi technology in mapping the scene two trees.
fi_treegen10
- vc++ opengl实践分形树 可更改许多的条件 使树木发生变化-vc opengl practice fractal tree to alter the conditions in which many of the trees change
DrawTree
- 用opengl绘制树木的三维程序，并可以漫游、放大、缩小等操作。-trees with opengl rendering of 3D procedures, and can roam, zoom in and out such an operation.
huishufenxing
- 桧树分形小枝:win32+GDI+分形算法；经典课程例子的vc++实例-cypress trees Fractal branchlets : win32 GDI fractal algorithm; Classic examples of courses example vc
lst
- 一个LS文法系统。用分形技术生成一排树，模拟自然景观。参数由自己设置。-a grammar system. Fractal technology generated a row of trees, simulating the natural landscape. Set up by its own parameters.
bracktotree
- bracktotree.c something about trees you can use it at sometimes.-bracktotree.c something about trees you c an use it at sometimes.
k666.com
- 觉得洒家斤秒十第毫分度万亿欧文前进考察劳动撒欧文全家福劳动撒棵需要解压-feel that the burden seconds! 10 trillion for the first Haofen forward Owen inspection work Saou-labor family portraits scattered trees need to decompress
tokensort
- 桶排序二叉搜索树，参考参考吧，没啥意思的-barrels Binary Search Trees, reference reference it, lacks meaning.
huffmancode111
- huffman完整源代码C语言实现，有本人超级详细解释（看不懂你去跳楼吧） 算法设计: 1、对给定的n个权值{W1,W2,W3,...,Wi,...,Wn}构成n棵二叉树的初始集合F={T1,T2,T3,...,Ti,...,Tn}，其中每棵二叉树Ti中只有一个权值为Wi的根结点，它的左右子树均为空。（为方便在计算机上实现算法，一般还要求以Ti的权值Wi的升序排列。） 2、在F中选取两棵根结点权值最小的树作为新构造的二叉树的左右子树，新二叉树的根结点的权值为其左右子树的根结点的权值之