Description: Undirected graph with n cities that traffic between the network construction plan, the vertices represent the city, right next to that the cost of the line, try to design a program, making the total cost of this transportation network minimum, that is seeking the minimum spanning tree problem .
To Search:
File list (Check if you may need any files):
最小生成树.docx
Download