查看会员资料
用 户 名:y*****
发送消息- Email:用户隐藏
- Icq/MSN:
- 电话号码:
- Homepage:
- 会员简介:
最新会员发布资源
sdf
- 最小生成树的数据结构解法,若要在n个城市之间建设通信网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网-Minimum spanning tree method of data structure, to cities in the n-building communications between the network only need to set up n-1 lines to. How to minimize the economic cost of buildin