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

．已知无向图如下所示

()．给出从V开始的广度优先搜索序列()．画出它的邻接表

()．画出从V开始深度优先搜索生成树【燕山大学 五 (分)】

第题图 第题图

．已知某图的邻接表为

()．写出此邻接表对应的邻接矩阵(分)

()．写出由v开始的深度优先遍历的序列(分)

()．写出由v开始的深度优先的生成树(分)

()．写出由v开始的广度优先遍历的序列(分)

()．写出由v开始的广度优先的生成树(分)

()．写出将无向图的邻接表转换成邻接矩阵的算法(分) 【山东大学 六分】

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