- Category:
- Data structs
- Tags:
-
- File Size:
- 4kb
- Update:
- 2018-02-09
- Downloads:
- 0 Times
- Uploaded by:
- lina111
Description: The young adult tree is actually the abbreviation of the minimum power regeneration. The spanning tree of a connected graph with n nodes is the minimal connected subgraph of the original graph, and contains all n nodes in the original graph, and has the least edge to keep the graph connected. The minimum spanning tree can be obtained using kruskal (kruskal) algorithm or Prim (Prim) algorithm.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 最小生成树.cpp | 12705 | 2016-11-21 |
Download