搜索资源列表
INprinttree
- 凹入表的形式打印树 一先序遍历输入,把树转化成二叉树-Indentations in the form of a first print tree traversal input, the trees into tree
huffmantree
- 自己做的赫夫曼树,可能不是很完善,传上来交流一下-The Huffman trees themselves, may not be perfect, Chuan-up exchange
shujujiegou
- 数据结构的线性表及其应用,树和二叉树的建立和应用,查找和排序-The linear table data structure and its application, trees and tree establishment and applications, search and sort
kd-trees
- 数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构:线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree
Renju
- 五子棋的的程序,用MFC编写了游戏的运行界面,主要的算法是试用了博弈树和博弈决策!-Gobang of procedures, using MFC prepared to run the game interface, the main algorithm is tested in decision-making game trees and games!
VChaffuman
- 哈夫曼编码在文件压缩中有其独特一点,它的编码方式特殊。在通信领域可以得到应用。本程序使用C++编写,在VC6.0上调试,完成了文件的读取,文件字符的统计,哈夫曼树的建立,哈夫曼编码的实现,文件转换为哈夫曼编码成为压缩文件以及文件从压缩状态进行解码。-Huffman file compression in a unique point, and its special encoding. In communications applications can be. This procedure
shu_ju_jie_gou_ke_cheng_she_ji(1)
- 数据结构课程设计源码以及报告 有3个程序:1)哈弗曼树及哈弗曼编码 2)排序—内部排序方法 3)Hanoi Tower-Data structure, as well as curriculum design source reported three procedures: 1)哈弗曼trees and哈弗曼coding 2) sort- internal sorting method 3) Hanoi Tower
forest
- 森林火灾预测模拟,火灾因闪电造成,绿色为绿树区,黑色为着火区。在未来一段时间内的情况。-Forecast simulation of forest fires, fires caused by lightning, green areas for the trees, black for the fire district. Over a period of time in the future situation.
Virtual_Flower
- Virtual Flower v1.2 一款三维的虚拟鲜花,树木以及森林的制作软件。提供的动画功能,可以看到树木摇曳生长的过程。-Virtual Flower v1.2 a virtual three-dimensional flowers, trees and forest production software. Provided animated features, we can see trees swaying in the process of growth.
DataStructurePart3
- 学校老师上课的讲义和习题解答。这一部分关于树和二叉树。-School teachers class lectures and exercises to answer. This part on the trees and tree.
powernetwork1_gui
- 通过MATLAB编程实现自动输出A矩阵,输出图的一棵树,输出图的所有的树-Through MATLAB programming for automatic output A matrix, the output of a tree diagram, the output map all the trees
dtree_up.cpp
- spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick trees. Offline algorithm for queries
kmt
- 给定一棵有向树T,树T中每个顶点u都有一个权w[u],树的每条边[u,v]也都有一个非负边长d[u,v]。有向树T的每个顶点u可以看做客户,其服务需求量为w[u]。每条边[u,v]的边长d[u,v]可以看做是运输费用。如果在顶点u处未设置服务机构,则将顶点u处的服务需求沿有向树的边(u,v]转移到顶点v处服务机构,则需付出的服务转移费用为w[u]*d[u,v]。树根处已设置了服务机构,现在要在树T中增设k处服务机构,使得整棵树T的服务转移费用最小。该算法对于给定的有向树T,计算在树T中增设k处
ext-tree
- ext的树的实例.通过右键菜单操作树节点对数据库进行增删改查.-Examples of trees ext. through the operation menu tree node additions and deletions to the database search.
Trees
- 一棵包含6个分支点的树的例子,演示JTree的实现过程。-java Jianshu
trees
- 数据结构基础( C): splay 树; BS 树; AVL 树-Datastructure in C: splay tree; BS tree; AVL tree
rbtree
- 红黑树是一种自平衡二叉查找树,是在计算机科学中用到的一种数据结构,典型的用途是实现关联数组。-AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n). In practice, the
prim
- 自己编的,在VB中实现普里姆最小生成树算法的代码,有图的,边的权值是随机生成的,5个节点,点“generate tree”,就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" ,
TG_KStabla_1
- Very good Java Applet used to animate Inserting, Deleting and Searching (Preorder & Postorder algorithm) nodes in Binary Trees. This is a part of mine students project. You can use and redistribute the source code absolutelly free!
TsinghuaCdatastructures
- 清华+殷人昆C++数据结构 幻灯片教学课件 通过本课程的学习,应达到知识和技能两方面的目标: 1、知识方面:从数据结构的类定义和对象的使用,以及存储表示和操作的实现两个层次,系统地学习和掌握常用的基本数据结构(包括数组、顺序表、多项式、字符串、链表、栈与队列、优先级队列、广义表、树与森林、二叉树、堆、集合、图、搜索结构、索引结构、散列结构等)及其不同的实现,了解并掌握分析、比较和选择不同数据结构、不同存储结构、不同算法的原则和方法,为后续课程的学习打好基础。 -Tsinghua Q