搜索资源列表
ieee1394diag-1.0.3
- IEEE1394Diag is a GUI application that presents a graphical view of an IEEE1394 network and provides the ability to perform common 1394 operations such as async reads, writes, isoc listens and talks, as well as configuration rom browsing of all nodes
TreeOper
- java 树操作函数,建树,插入分支,插入节点,查找节点, 可指定字段排序-java tree manipulation functions, achievements and the insertion of branches, insert nodes, the nodes you can order the specified field
TestD&DTree_e
- 本程序是在JBuild 9.0中开发的，主程序是 DiskManager.java。实现一个树形控件，可以添加和删除节点。-this procedure was developed JBuild 9.0, is the main program DiskManager.java. Achieving a tree controls, can add and delete nodes.
IniSnake
- 一个自己写的设置SNAKE初始节点的MATLAB程序,以绿色十字标记节点位置,在此基础上可以编制自己的SNAKE算法,-himself wrote a set of Snake initial nodes MATLAB procedures to Green Cross markings node location, on this basis can prepare their own Snake algorithm, huh
treeViewChart
- treeview拖拉节点到chart，以便在chart上添加该属性的数据，从而画曲线-treeview drag nodes to chart to chart to add the attribute data, thereby painting curve
KoSMSGateWay_Pro36
- 使用单链表实现本程序要求，单链表每个节点存储一个学生的信息。 创建一个链表类（List），链表类可实现如下功能： 创建链表，插入节点，删除节点，编辑节点，显示节点，保存链表信息等功能，读入数据文件等功能（详细说明请查看源代码）。 创建一个操作类（Operater），操作类实现如下功能： 显示菜单，操作链表。-use a single linked list to achieve the procedural requirements of each node-Chain stor
josephus.1
- 描述：设编号为1,2,…,n(n>0)个人按顺时针方向围坐一圈，每人持有一个正整数密码。开始时任意给出一个报数上限值m，从第一个人开始顺时针方向自1起顺序报数，报到m时停止报数，抱m的人出列，从他在顺时针方向上的下一个人起重新自1起顺序报数；如此下去，直到所有人全部出列为止。要求设计一个程序模拟此过程，并给出出列人的编号序列。 ．算法思想： Jeseph函数是实现问题要求的主要函数，其算法思想是：从1至m对带头结点的单循环链表循环计数，到m时，输出该结点的编号值，，再从
InterpolationSmoothIsometry
- 给定n个等距节点的函数值，使用阿克玛方法计算指定子区间的三次插值多项式与指定插值点的函数值-given n equidistant nodes function values calculated using Akima designated subinterval of the three interpolation polynomial interpolation points with a specified value of the function
InterpolationSmoothNotIsometry
- 光滑不等距插值，给定不等距节点的函数值，用阿克马方法计算指定区间上的三次插值多项式与指定插值点的函数值-not equidistant smooth interpolation, not to set equidistant nodes function values calculated using rivers designated interval of three interpolation polynomial interpolation points with a specified
InterpolationHermiteIsometry
- 艾尔米特等距插值。给定n个不等距节点的函数值及一阶导数值，使用埃尔米特插值公式计算指定插值点t处的函数近似值-Hermite Isometry Interpolation: to calculate the approximation of the function at the specified interpolation point t by using Hermite Isometry Interpolation function, which is based on the fun
node-degree
- 复杂网络 节点度统计程序 C++ 网络中的节点度指与节点相连的边的个数-Complex statistical procedures for network nodes C++ Network nodes and node degrees refers to the number of connected edge
WSN
- 利用极大值估计法进行节点之间的定位。模拟真实环境进行仿真- Estimated using the maximum method of positioning between nodes. Simulate the real environment simulation
MinDistTest
- 一个查找带权拓扑图中，任意两点最短距离的算法函数，函数名为MinDis，开发环境是vc6.0，界面和工程只是举了个例子，测试下10个节点中任意两个节点查找最短路径。 -Find the right one with a topology, the shortest distance between any two points in the algorithm function, the function is named MinDis, the development environmen
d009_dyn
- 标准9节点psat动态模型，包含模型描述以及simulink下搭建的模型-9 nodes psat standard dynamic model, including model descr iptions and model structures under simulink
FLOYD
- 基于时延的路由协议模拟器 主要使用到了计算两结点间最短路径的FLOYD算法 -Delay-based routing protocol simulator mainly used to calculate the two shortest path between nodes FLOYD algorithm
Dynamically-add--delete-nodes-
- 动态添加、删除树形控件的节点，获取树形控件的选中项-Dynamically add, delete nodes in the tree control, get control of the selected tree item
omnetPP100-nodes-routing-protocol
- omnet下仿真100个节点的路由协议程序，应使用omnet++网络仿真软件-The programme is to simulate a routing protocol which has 100 nodes. And it uses OMNET++ software.
the-neighbor-nodes-k-values
- 查找邻居节点k壳值, 查找邻居节点k壳值.-find the neighbour nodes K shell value
Reverse-Nodes-in-k-Group
- 给定一个链表，然后给定一个阈值，每隔这个阈值就反转这几个点-Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
Swap-Nodes-in-Pairs
- 给定一个链表，对其结点进行两两交换，然后返回结果链表的首结点-Given a linked list, swap every two adjacent nodes and return its head.