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

．已知一图如下图所示

()．写出该图的邻接矩阵

()．写出全部拓扑排序

()．以v为源点以v为终点给出所有事件允许发生的最早时间和最晚时间并给出关键路径

()．求V结点到各点的最短距离【北京邮电大学 五 (分)】

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