搜索资源列表
adraag-drop-fj
- ajax 拖拽树能拖拽节节点 删除节点 重命名节点 -the ajax drag trees can drag Festival node delete node rename node
FlowerMail
- GTK 邮件图形界面 ，内含树，文本框 ，列表等多种widget-GTK mail graphical interface, containing trees, text boxes, lists, and other widget
active-learning-code
- Learning_random.m : 随机选择样例，从（90）pool里随机选择样本，删除版本空间树的数量 activeLearning.m:根据最大熵原则,从pool里选择样本，删除版本空间树的数量 getlabel.m:根据树和测试样例，得到根据该树得到的类标 getTrees.m:从提供的大量树结构(随机生成的)中，随机挑选一定数量的树(如果该树的叶子节点无类标随机添加) RandomCreateTree_d_unbalance:根据样本点割点中的非平衡割点建造树，
LovelyTree3.6exesrc
- 小树可执行程序和源代码,一个csharp源码，值得参考-The small trees executables and source code, a csharp source, worth considering
Forest-fire-detection
- A network of Sensor Nodes can be installed in a forest to detect when a fire has started. The nodes can be equipped with sensors to measure temperature, humidity and gases which are produced by fire in the trees or vegetation. The early detection is
LTree
- c++源码分形树的实现，利用L系统双击界面后随机生成一棵树-c++ source fractal tree implementation using the L-system Double-click interface randomly generated trees
trees-DLR-and-LDR
- 设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。 -Let binary tree node value of capital letters input binary tree preorder traversal and inorder traversal sequences, this binary tree is gene
koucai
- 1-内容介绍：收录常见花草树木约3980种植物，包括部分珍惜品种。 2-关于开源：源码内对可以改写部分做了详细的注解，站长可以根据自己的需要修改源码以满足需求。 3-关于软件：ASP.NET+ACCESS，不需要安装复制即可运行。防止SQL注入设计。 4-要点说明：适合口才，社交类网站下载，或者有兴趣的个人发展借鉴之需要。-1- Introduction: Indexed common flowers and trees about 3980 kinds of plants,
louhome_plants
- 1-内容介绍：收录常见花草树木约3980种植物，包括部分珍惜品种。 2-关于软件：ASP.NET+ACCESS，不需要安装复制即可运行。防止SQL注入设计。 3-关于开源：源码内对可以改写部分做了详细的注解，站长可以根据自己的需要修改源码以满足需求。-1- Introduction: Indexed common flowers and trees about 3980 kinds of plants, including part of the treasure varieties
CS2208_DSLab_Programs
- CS2208 - Data Structures Lab (Anna University) EXERCISES 1a. Implement singly linked lists. 1b. Implement doubly linked lists. 2. Represent a polynomial as a linked list and write functions for polynomial addition. 3. Implement stack and
Samples
- 数据结构，简单排序，树，链表，队列，堆栈的用法-Use of the data structure, a simple sort, trees, linked lists, queues, stacks
tree
- 有一段马路，两旁种了树，遇到十字交叉路口则不种树，如何计算一段距离之内中了多少棵树？-how to calculate the amouts of trees in a long distansce.
huffmancode-0.1
- 构造霍夫曼树 ////////////////////// //根据权重生成霍夫曼树 //weight 权重数组 //n 权重数组长度 //NewTree 新生成的霍夫曼树 void createHFMTree(int* weights,int n,BinaryTree<int>& NewTree) { //初始化堆 MinHeap<BinaryTree<int> > heap(n) int i=0 f
shujujiegou
- c语言编写的各种数据结构功能的实现，应有尽有（包括图，链表，二叉树等等的实现和应用）-c language data structure and function of the realization of everything (including the implementation and application of the chart, linked lists, binary trees, etc.)
gaz-0.4
- 嘎斯TreeStore和树型视图是两类,可用于实现MVC列表树只需几行Javascr ipt代码。虽然没有太多的文档目前的例子是相当不言自明。 -Gaz TreeStore and TreeView are two classes that can be used to implement MVC tabular trees in just a couple of lines of Javascr ipt code. While there isn t much documentation
simulation
- 涵盖目前识别和智能计算的理论和方法，包括支持向量机，神经网络，决策树，粗糙集理论，模糊集理论，和遗传算法-Covers the recognition and intelligent computing theory and methods, including support vector machines, neural networks, decision trees, rough set theory, fuzzy set theory and genetic algorithm
trees
- 用C语言简单有效实现数据结构中二叉树的遍历。-Traversal of a binary tree data structure C language
triangle-in-the-tree
- 有一棵树，树上有只毛毛虫。它在这棵树上生活了很久，对它的构造了如指掌。所以它在树上从来都是走最短路，不会绕路。它还还特别喜欢三角形，所以当它在树上爬来爬去的时候总会在想，如果把刚才爬过的那几根树枝/树干锯下来，能不能从中选三根出来拼成一个三角形呢？-A tree, a tree caterpillar. It in the tree of life for a long time, it constructed well aware. In the trees, it has always be
ID3_src
- Decision tree builds classification or regression models in the form of a tree structure. It breaks down a dataset into smaller and smaller subsets while at the same time an associated decision tree is incrementally developed. The final result is a t
sjjg
- 华南农业大学数据结构上机实验答案，包含线性表,栈，队列，树，图，查找，排序，串-Machine data structure experimental answer of South China Agricultural University, including linear table, stacks, queues, trees, find, sort, string