Location:
Search - MST 7
Search list
Description: MST710原理图... ..模拟屏驱动IC-MST710 diagram .............. simulation Screen Driver IC
Platform: |
Size: 59392 |
Author: 郑清江 |
Hits:
Description: MSTAR方案的车载TV资料，很有用的东东哦-mst car tv program files ,it s very usefull!
Platform: |
Size: 1057792 |
Author: jackey |
Hits:
Description: mst方案芯片升级USB工具，内包含整个ORCAD原理图及PADS原理图及零件BOM清单，有需要的可以下载参考。 -mst program chip to upgrade USB tool, contains the entire ORCAD and PADS schematic diagram and parts BOM list of those in need can be downloaded for reference.
Platform: |
Size: 128000 |
Author: yangwen |
Hits:
Description: Example
编译：mpicc mst.c mst
运行：本实例中使用了5个处理器。
mpirun –np 5 mst
运行结果：
Input the size of matrix:9
0 4 5 8 6 2 5 7 3
5 0 8 3 1 6 4 9 5
7 2 0 6 4 1 3 8 9
4 5 6 0 5 7 2 1 6
4 5 8 7 0 2 3 4 7
4 1 4 7 5 0 7 8 4
7 8 9 3 2 1 0 6 7
4 2 1 4 3 5 8 0 9
5 3 2 8 9 7 6 2 0
最终输出结果：
the MST is:
0 0 0 0 0 2 0 0 0
0 0 0 0 1 1 0 0 0
0 0 0 0 0 1 0 1 2
0 0 0 0 0 0 0 1 0
0 1 0 0 0 2 0 0 0
2 1 1 0 2 0 1 0 0
0 0 0 0 0 1 0 0 0
0 0 1 1 0 0 0 0 0
0 0 2 0 0 0 0 0 0
说明：输出结果为最小生成树的边。
-
Example
Compile: mpicc mst.c mst
Run: The example of the use of the five processors.
mpirun-np 5 mst
Run Results:
Input the size of matrix: 9
045,862,573
508,316,495
720,641,389
456,057,216
458,702,347
414,750,784
789,321,067
421,435,809
532,897,620
The final output:
the MST is:
000,002,000
000,011,000
000,001,012
000,000,010
010,002,000
211,020,100
000,001,000
001,100,000
002 million
Description: The output for the minimum spanning tree edges.
Platform: |
Size: 2048 |
Author: aaa |
Hits:
Description: MST712小尺寸TCON控制器原理图，可以做监视器移动DVD显示主控-MST712 small size TCON controller schematic, you can do mobile DVD shows the master monitor
Platform: |
Size: 1091584 |
Author: 刘皓杰 |
Hits:
Description: Sweet Controls v3.65 For Delphi 4.5.6.7.2005 Cracked Mst
Platform: |
Size: 8627200 |
Author: sinbh |
Hits:
Description: CS2208 - Data Structures Lab (Anna University)
EXERCISES
1a. Implement singly linked lists.
1b. Implement doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim s algorithm using priority queues to find MST of an undirected graph.
Platform: |
Size: 209920 |
Author: Narayana Swamy |
Hits:
Description: 遗传算法解决最小生成树问题的Python实现
需要安装
1. Python 2.7
2. matplotlib.pyplot
3. networkx(Python implementation of genetic algorithm for minimum spanning tree problem
Need to install
1. Python 2.7
2. matplotlib.pyplot
3. Networkx)
Platform: |
Size: 27648 |
Author: moser1125 |
Hits: