Listing All Minimum Spanning Trees in an Undirected Graph Using MapRedcue
碩士 === 國立臺北商業技術學院 === 資訊與決策科學研究所 === 102 === Given an undirected graph with integral edge weights, there may be more than one minimum spanning trees. Depending on the increasing of nodes and edges, the number of minimum spanning trees may increase enormously. The enumerating algorithm in thesis is...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/58521198248003897516 |