1、 有n個學生，每個學生有m門成績，每個學生的m門成績用一單鏈表實現，n個學生所對應n個單鏈表的頭指針用一指針數組統一存放。 1) 建立該存貯結構。 2) 查找第i個學生的某門課成績。 鏈表中結點結構： struct node {char *nam；/*nam為課程名*/ float sco；/*sco為該門課程的成績*/ struct node *link；/*link為指向下一課程結點的指針*/
標簽：
上傳時間： 2013-12-14
上傳用戶：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-07
上傳用戶：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-25
上傳用戶：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-04
上傳用戶：kiklkook
