搜索资源列表
java1(3)
- 这是一个用JAVA编写的从jtree中删除一个节点的代码-This is a preparation with Java from jtree delete a node code
lagrange
- 1.n个节点分段Lagrange插值多项式； 2.使用格式y=lagrange(x0,y0,x,k)； 3.输入项x0为n维插值节点向量，y0为n维被插函数值向量； 4.x为m维插值点向量，k为分段插值多项式次数，不超过3，缺省为k=1； 5.输出y为插值点x处的函数值；- 1.n a sub-node Lagrange interpolation polynomial 2. The use of the format y = lagrange (x0, y0,
Node1
- networking code for 1 node
TopoGen
- 用java语言编写的用于在ns2上布置节点的实例Using java language on the arrangement for node in ns2 examples-Using java language on the arrangement for node in ns2 examples
2-3-Tree
- 2-3 Tree implementation wich can insert search a node and always shows in graphical the tree.
BiNode
- java实现的二叉树图形演示程序，能够进行添加，删除以及查找父节点等操作。-java implementation of binary graphics demo program that can be added, deleted, and find the parent node and other operations.
huffman
- 哈夫曼（Huffman）树又称最优二叉树或最优搜索树，是一种带权路径长度最短的二叉树。在许多应用中，常常赋给树中结点一个有某种意义的实数，称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL)，树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree,
the-one-1.6.0
- 用于DTN仿真的开发平台，包含多种常见路由算法与节点运动模型。(DTN simulator, include several typical routing schems and node movement model.)
play
- play music document node files good