搜索资源列表
Link_Find
- 编写能实现上述功能的Link(v,r)指令程序，不要使用全局变量， 设初始时两森林均由单结点树构成。上机依次执行：Link(2,1), Link(3,2), Link(5,4), Link(4,3), Link(7,6),Link(9,8), Link(8,7), Find-Depth(6), Link(6,5), Find-Depth(4), Find-Depth(7)。 打印或抄写每条指令执行后各点的Weight值，画出其时的两种森林。 -Prepared to a
Prim
- 算法特点：该算法的特点是当前形成的集合T始终是一棵树。将T中U和TE分别看作红点和红边集，V-U看作蓝点集。算法的每一步均是在连接红、蓝点集的紫边中选择一条轻边扩充进T中。MST性质保证了此边是安全的。T从任意的根r开始，并逐渐生长直至U=V，即T包含了 C中所有的顶点为止。MST性质确保此时的T是G的一棵MST。因为每次添加的边是使树中的权尽可能小，因此这是一种"贪心"的策略。 -Algorithm characteristics: the algorithm is characteriz
swig-2.0.0.tar
- SWIG is a software development tool that connects programs written in C and C++ with a variety of high-level programming languages. SWIG is primarily used with common scr ipting languages such as Perl, PHP, Python, Tcl/Tk, and Ruby, however the list
ln_rtree
- 建立r树，使用c++完成，对于学习树的建立很有好处-create r-tree，use c++
rtree
- 学习r树和二叉树的必要经历，可以帮助我们学习理解树-study B-tree and r-tree
Binary-Trees-(ABB)
- In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tr