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

．求出下图中顶点到其余各顶点的最短路径【厦门大学 八 (分)】

．试利用Dijkstra算法求下图中从顶点a到其他个顶点间的最短路径写出执行算法过程中各步的状态【东南大学 四(分)】

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