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

．下面的邻接表表示一个给定的无向图

()给出从顶点v开始对图G用深度优先搜索法进行遍历时的顶点序列

()给出从顶点v开始对图G用广度优先搜索法进行遍历时的顶点序列【复旦大学六(分))

．给出图G

()．画出G的邻接表表示图

()．根据你画出的邻接表以顶点①为根画出G的深度优先生成树和广度优先生成树【南开大学 五 (分)】

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