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

．用最短路径算法求如下图中a到z的最短通路【西南财经大学 四】

．已知一有向网的邻接矩阵如下如需在其中一个结点建立娱乐中心要求该结点距其它各结点的最长往返路程最短相同条件下总的往返路程越短越好问娱乐中心应选址何处？给出解题过程【北京邮电大学 四 (分)】

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