Description: The n cities to establish communication between networks, the need to set up n-1 lines. How to solve this at the lowest economic cost of building communications network, which is a minimum spanning tree problem. Requirements: (a) the use of plym algorithm for minimum spanning tree network (2) the output of each spanning tree edge and weights.
To Search:
File list (Check if you may need any files):
kk.doc
Download