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

有一个用于n个顶点连通带权无向图的算法描述如下

()．设集合T与T初始均为空

()．在连通图上任选一点加入T

()．以下步骤重复n次

a在i属于Tj不属于T的边中选最小权的边

b该边加入T

上述算法完成后T中共有______条边该算法称______算法T中的边构成图的______【南京理工大学 二 (分)】

有向图G可拓扑排序的判别条件是______【长沙铁道学院 二(分)】

Dijkstra最短路径算法从源点到其余各顶点的最短路径的路径长度按______次序依次产生该算法弧上的权出现______情况时不能正确产生最短路径【南京理工大学 二(分)】

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