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

．已知顶点和输入边与权值的序列(如右图所示)每行三个数表示一条边的两个端点和其权值共行请你

()．采用邻接多重表表示该无向网用类PASCAL语言描述该数据结构画出存储结构示意图要求符合在边结点链表头部插入的算法和输入序列的次序

()．分别写出从顶点出发的深度优先和广度优先遍历顶点序列以及相应的生成树

()．按prim算法列表计算从顶点始求最小生成树并图示该树【北京工业大学 四(分)】

．下图表示一个地区的通讯网边表示城市间的通讯线路边上的权表示架设线路花费的代价如何选择能沟通每个城市且总代价最省的n条线路画出所有可能的选择【东北大学一(分)】

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