- Category:
- Other systems
- Tags:
-
- File Size:
- 15kb
- Update:
- 2018-04-12
- Downloads:
- 0 Times
- Uploaded by:
- zhych233
Description: The smallest spanning tree is:
When all data satisfy a tree, a path that connects all nodes is the shortest one, because there is any weight between two nodes.
The weight between two points is a specific number. The weights between the two points are infinite.
Here are two general algorithms for finding minimum spanning tree.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 新建 Microsoft Word 97 - 2003 文档.doc | 182518 | 2018-04-12 |
Download