—图数据类型的实现——问题描述：图是一种较线性表和树更为复杂的数据结构。在图形结构中，结点之间的关系是任意的，任意两个数据元素之间都可能相关，因此，图的应用非常广泛，已渗入到诸如语言学‘逻辑学、物理、化学、电讯工程、计算机科学及数学的其它分支中。因此，实现图这种数据类型也尤为重要，在该练习中即要实现图的抽象数据类型。基本要求：2、 定义出图的ADT；3、 采用邻接矩阵及邻接表的存储结构（有向图也可使用十字链表）实现以下操作：a. 构造图 b. 销毁图 c. 定位操作d. 访问图中某个顶点的操作e. 给图中某个顶点赋值的操作f. 找图中某个顶点的第一个邻接点g. 找出图G中顶点v相对于w的下一个邻接点h. 在图G中添加新顶点vi. 删除图G中顶点vj. 在图G中插入一条边k. 在图G中删除一条边l. 实现图的深度遍历操作m. 实现图的广度遍历操作参考提示：具体内容参看教科书本156页实验要求：对于以上具体操作要求实现时有良好的用户交互界面。详细设计、编码、测试。
上传时间： 2015-03-13
上传用户：saharawalker
USB Manager(usbmgr) 0.4.8 Shuu Yamaguchi <shuu@wondernetworkresources.com> Special Helper: Philipp Thomas When USB devices connect to or disconnect from a USB hub, the usbmgr works as the following according to configuration. a) It loads and unloads files Linux kernel modules. b) It execute file to setup USB devices.
标签： wondernetworkresources Yamaguchi Manager Special
上传时间： 2014-01-27
上传用户：zhaiyanzhong
Rotating shafts experience a an elliptical motion called whirl. It is important to decompose this motion into a forward and backward whil orbits. The current function makes use of two sensors to generate a bi-directional spectrogram. The method can be extended to any time-frequency distribution ％ ％ compute the forward/backward Campbell/specgtrogram ％ ％ INPUT: ％ y (n x 2) each column is measured from a different sensor ％ /////// ％ __ ％ |s1| y(:,1) ％ |__| ％ __ ％ / \ ________|/ ％ | | | s2 |/ y(:,2) ％ \____/ --------|/ ％ ％ Fs Sampling frequnecy ％ ％ OUTPUT: ％ B spectrogram/Campbel diagram ％ x x-axis coordinate vector (time or Speed) ％ y y-axis coordinate vector (frequency [Hz])
标签： experience elliptical decompose important
上传时间： 2015-06-23
上传用户：372825274
加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds]
标签： Cryptographic Primitives generate Library
上传时间： 2015-07-16
上传用户：wqxstar
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
标签： APPROXIMATE ALGORITHM THE SOLUTION
上传时间： 2015-08-20
上传用户：zhangliming420
performs one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A *x + beta*y, where alpha and beta are scalars, x and y are vectors and A is an m by n matrix
标签： alpha beta matrix-vector operations
上传时间： 2014-08-17
上传用户：qlpqlq
acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
标签： WoodenSticks Description length wooden
上传时间： 2014-03-08
上传用户：netwolf
代入法的启发示搜索 我的代码实现是：按照自然语言各字母出现频率的大小从高到低（已经有人作国统计分析了）先生成一张字母出现频率统计表（A）--------(e),(t,a,o,i,n,s,h,r),(d,l),(c,u,m,w,f,g,y,p,b),(v,k,j,x,q,z) ，再对密文字母计算频率，并按频率从高到低生成一张输入密文字母的统计表（B），通过两张表的对应关系，不断用A中的字母去替换B中的字母，搜索不成功时就回退，在这里回朔是一个关键。
上传时间： 2015-10-24
上传用户：wanqunsheng
黑白点的匹配贪心算法 设平面上分布着n个白点和n个黑点，每个点用一对坐标（x, y）表示。一个黑点b=（xb,yb）支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw。若黑点b支配白点w，则黑点b和白点w可匹配（可形成一个匹配对）。在一个黑点最多只能与一个白点匹配，一个白点最多只能与一个黑点匹配的前提下，求n个白点和n个黑点的最大匹配对数。
上传时间： 2015-10-25
上传用户：zhliu007
This a calculator simulation program written in Labview. It is based on event structure introduced by Labviw 8.0 or later editions.
标签： calculator simulation introduced structure
上传时间： 2015-12-27
上传用户：123456wh
