搜索资源列表
java1(3)
- 这是一个用JAVA编写的从jtree中删除一个节点的代码-This is a preparation with Java from jtree delete a node code
Java 二叉树 算法
- 用Java编写的二叉树的数据结构，包括二叉树的每个节点的值，以及各子树的指针。 -Java prepared by the binary tree data structures, including binary tree each node values, and the subtree target.
Tracker
- 以C#方式实现BT下载过程中的Tracker服务器端。监控链接的客户，提供种子发布，寻找资源，实时更新节点信息-Be achieved in C# in the process of BT download Tracker server-side. Monitor link customers to provide seed release, find the resources, real-time update the node information
tree
- 可以有多层目录的树控件,连接数据库,自由的添加删除节点!-Can have multi-directory tree controls, connect database, free to add delete the node!
dijkstra-java
- Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 -Dijkstra algorithm is a typical example of the most short-circuit algorithm, used
ClusterMonitor
- 一个多集群的监控系统，可根据文件中定义的入口IP地址获取其机器上的GANGLIA信息，监控其所在网格内所有集群信息和节点机的CPU、内存、硬盘、负载等信息。-More than one cluster of monitoring systems, can be defined in accordance with the entrance of the document to obtain its IP address Ganglia machine information, monitor t
node
- 模拟网络通信，对其中的信息进行统计，用贝叶斯算法计算特定信息的后验概率，自动日志-Simulation of network communications, for which statistical information, using Bayesian algorithm-specific information on a posteriori probability, automatic log
090619
- 理解二叉树特别是完全二叉树的性质，掌握二叉树的存储结构（二叉链表）；熟练掌握二叉树的常用操作算法（初始化、插入结点、删除结点、遍历等）；初步掌握二叉树的应用。-Binary tree in particular, to understand fully the nature of binary tree, binary tree master storage structure (List Binary) proficiency in commonly used binary tree alg
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,
SP
- 提出了一个新奇的用来构建和维护覆盖网拓扑的一般机制。该机制基于gossip模式，节点和随机选择的对等体交换信息，并按照特定的P2P应用需求来重新安排拓扑，本协议非常的高效和鲁棒，能够处理节点持续的加入和离开系统的流，且即使现存的所有SP移除也能修复。-In this code,we propose a novel approach to construct and maintain the topology. This approach is based on gossip protocol,
Node1
- networking code for 1 node
2-3-Tree
- 2-3 Tree implementation wich can insert search a node and always shows in graphical the tree.
src
- 距离向量算法的实现，利用多线程机制，进行结点初始化流程程序设计；进行结点距离向量消息的收发-Distance vector algorithm, using multi-thread mechanism for node initialization process programming to nodes send and receive messages from the vector
binarysearchtree
- Binary Search Tree with Node class.-Binary Search Tree with Node class.
ID3-java-
- ID3决策树算法的JAVA实现.详细的实现过程：熵值条件熵，节点选择等。-ID3 decision tree algorithm JAVA implementation. Detailed implementation process: entropy conditional entropy, the node selection.
Java-binary-tree
- 用Java编写的二叉树的数据结构，包括二叉树的每个节点的值，以及各子树的指针。 -Written in Java binary tree data structure, including the value of each node of a binary tree, and each sub-tree pointer.
HostV3
- 实现无线控制,无线路由器的桌面程序,包括节点的状态,信道的多少等等(Wireless control, wireless router desktop program, including the status of the node, the number of channels, and so on)
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