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

．下图所示是一带权有向图的邻接表法存储表示其中出边表中的每个结点均含有三个字段依次为边的另一个顶点在顶点表中的序号边上的权值和指向下一个边结点的指针试求

()．该带权有向图的图形

()．从顶点V为起点的广度优先周游的顶点序列及对应的生成树(即支撑树)

()．以顶点V为起点的深度优先周游生成树

()．由顶点V到顶点V的最短路径【中山大学 四 (分)】

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