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

．已知一个无向图如下图所示要求分别用Prim和Kruskal算法生成最小树(假设以①为起点试画出构造过程)【哈尔滨工业大学 九 (分)】

．G=(VE)是一个带有权的连通图则

()．请回答什么是G的最小生成树

()．G为下图所示请找出G的所有最小生成树【北方交通大学 二 (分)】

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