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

．设无向网G 如

()． 设顶点abcdefh的序号分别为请列出网G的邻接矩阵画出网G 的邻接表结构:

()．写出从顶点a出发按深度优先搜索和广度优先搜索方法遍历网G所的到的顶点序列

按Prim算法求出网G的一棵最小生成树【北京科技大学 五 (分)】

．有一图的邻接矩阵如下试给出用弗洛伊德算法求各点间最短距离的矩阵序列AAAA【北京邮电大学四(分)】

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