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

．设G=(VE)以邻接表存储如图所示试画出图的深度优先和广度优先生成树【北京轻工业学院 八 (分)】

．对一个图进行遍历可以得到不同的遍历序列那么导致得到的遍历序列不唯一的因素有哪些？【北京航空航天大学 一 (分)】

．解答下面的问题

()．如果每个指针需要个字节每个顶点的标号占个字节每条边的权值占个字节下图采用哪种表示法所需的空间较多？为什么?

()．写出下图从顶点开始的DFS树【西安电子科技大学 计应用 六 (分)】

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