搜索资源列表
IEEEdata
- 电力潮流计算的标准ieee节点，分清华格式和国际格式，适合电力系统学生-Power flow calculation of the standard ieee node, sub-Tsinghua format and international formats, suitable for power system Students
code
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-sheet for the storage structure, to achieve connected undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, r
4nodes
- its 4 node simulation scr ipt of tcl file.....used simulation n analysis of aodv protocol
10060324
- 二叉树主要完成以下功能: 1. 建立二叉树 2. 计算结点所在的层次 3.统计结点数量(size)和叶结点数量 4.计算二叉树的高度 5.计算结点的度 6.找结点的双亲(Parent)和子女 7.二叉树的遍历 8.二叉树的输出-Main binary tree complete the following features: 1. The establishment of a binary tree. Calculate the junction point w
1211asd.RAR
- -Android 2.3.4 version of the UVC Camera test program, use YUYV format (in fact, MJPG format is used, as long as I commented out a few lines of code uncomment look like a camera), used in the android device node is/dev/video1 as a front camera, you w
optimal-binary-tree
- 这个程序通过dp来构建最优的二叉树，使得效率更好，将高概率的结点放在高处。通过o（n^2)实现。-To build this program by dp optimal binary tree, making better efficiency, the high probability of the node on the height. O (n ^ 2).
Cpp1
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
erchashu
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
77885
- 程序产生N个随机的整数，存放在数组a中。然后根据数组a建立线性链表， 再删除链表中所有重复元素，并输出无重复元素结点的链表结点的值 -Program generates a random integer N, stored in the array a. Then establish a linear list of the array, Then delete all duplicate elements in the list, and output
LEACH
- LEACH [1] is an autonomous adaptive clustering protocol that distributes the energy load evenly among the sensors in the network using randomization. The nodes organize themselves into local clusters, with one node acting as the local base stat
DVHOP
- 无线传感器节点定位方面的英文经典论文，对于我们的学习具有很大的帮助！-Wireless sensor node localization aspects of the English classic paper, we study the great help!
node-MATLAB
- 无线传感器节点定位技术的matlab的仿真，对与初学者具有一定的帮助！-Matlab simulation of wireless sensor node localization techniques for beginners with some help!
DV_hop_new
- 无线传感器节点定位技术的各种仿真程序，很适合用于更深入的理解-Wireless sensor node localization techniques of various simulation program, it is suitable for more in-depth understanding of
An-assessment-of-the-LS-DYNA
- The six hourglass formulations available in LS-DYNA for 8 node hexahedral elements are uated using the so called 3D Patch Test.-The six hourglass formulations available in LS-DYNA for 8 node hexahedral elements are uated using the so called 3D Patch
porpozal-eirad
- The load-flow analysis, implemented for both voltage regulation and voltage stability analysis, is performed by using the forward/ backward sweep method. The secant predictor technique is developed for predicting the node voltages which are the
5865_butterfly_ppt
- The more rigorous scheme numbers the node according to the principle that introduces the fewest new branches
RDKT
- 三节点三角形板单元，修正dkt单元，比原dkt单元精度更高-Three-node triangular plate unit, correcting dkt unit, higher than the original dkt unit Accuracy
malicious
- to introduce malicious node in the network in ns2.
最后
- 第一题：将一颗树或森林转换为二叉树 第二题：求森林高度 第三题：按层次方式遍历森林 第四题：输出一个森林中每个结点的值及对应的层次数 第五题：输出一个森林的广义表形式(First question: convert a tree or forest into two branches Second question: forest height The third question: traverse the forest in a hierarchical manner The