1、 有n个学生，每个学生有m门成绩，每个学生的m门成绩用一单链表实现，n个学生所对应n个单链表的头指针用一指针数组统一存放。 1) 建立该存贮结构。 2) 查找第i个学生的某门课成绩。 链表中结点结构： struct Node {char *nam；/*nam为课程名*/ float sco；/*sco为该门课程的成绩*/ struct Node *link；/*link为指向下一课程结点的指针*/
标签：
上传时间： 2013-12-13
上传用户：TF2015
A heap is a binary tree satisfying the following conditions: This tree is completely balanced. If the height of this binary tree is h, then leaves can be at level h or level h-1. All leaves at level h are as far to the left as possible. The data associated with all descendants of a Node are smaller than the datum associated with this Node.
标签： tree conditions completely satisfying
上传时间： 2014-01-01
上传用户：gundan
伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a Node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.
标签： 树
上传时间： 2017-05-06
上传用户：JIUSHICHEN
ETSI TS 125 433 V7.9.0(2008-07) Universal Mobile Telecommunications system (UMTS) UTRAN Iub interface Node B Application Part (NBAP) signalling
标签： Telecommunications Universal Mobile system
上传时间： 2013-12-21
上传用户：13188549192
This is a mutlicore and cluster(of single-core,multi-core systems) matrix inversion code. Which uses the MPI(Message Passing Interface) for communication across the compute Nodes of cluster and using thread-API based OpenMP(Open Multi Processing) between cores of intra-compute or head Node.
标签： single-core multi-core inversion mutlicore
上传时间： 2013-12-21
上传用户：ryb
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a Node are smaller than the datum associated with this Node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
标签： followingconditions tree completely satisfying
上传时间： 2017-05-24
上传用户：2467478207
链式队列，应该是正确的，包含Node的头文件和cpp
上传时间： 2014-01-26
上传用户：jichenxi0730
链式栈，应该是正确的，包含Node的头文件和cpp
上传时间： 2017-06-30
上传用户：康郎
With the Wireless module, OPNET can model both terrestrial and satellite radio systems. In this tutorial, you will use Modeler and Wireless modeling to create a radio network you will also observe variations in the quality of received signal that results from radio noise at the receiving Node in a dynamic network topology.
标签： terrestrial satellite Wireless systems
上传时间： 2017-08-06
上传用户：xwd2010
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The Nodes are numbered from 1 to n. The Node 1 and Node n should be in different sets. There are no more than 30 arcs and 15 Nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
标签： Implementation calculates algorithm Edmonds
上传时间： 2014-01-03
上传用户：kiklkook
