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

．对于如下的加权有向图给出算法Dijkstra产生的最短路径的支撑树设顶点A为源点并写出生成过程【吉林大学 一 (分)】

．已知图的邻接矩阵为

当用邻接表作为图的存储结构且邻接表都按序号从大到小排序时试写出

()．以顶点V为出发点的唯一的深度优先遍历

()．以顶点V为出发点的唯一的广度优先遍历

()．该图唯一的拓扑有序序列【同济大学 一 (分 )】

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