数据结构考研分类复习真题 第七章 图[39]

．已知世界六大城市为:北京(Pe)纽约(N)巴黎(Pa) 伦敦(L) 东京(T) 墨西哥(M)下表给定了这六大城市之间的交通里程:

()．画出这六大城市的交通网络图;

()．画出该图的邻接表表示法;

()．画出该图按权值递增的顺序来构造的最小(代价)生成树【上海海运学院 六(分) 五 (分)】

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []