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

．如下所示的连通图请画出

()．以顶点①为根的深度优先生成树(分)

()．如果有关节点请找出所有的关节点(分)【清华大学 七 (分)】

．某田径赛中各选手的参赛项目表如下:

设项目A B …F各表示一数据元素若两项目不能同时举行则将其连线(约束条件)

()．根据此表及约束条件画出相应的图状结构模型并画出此图的邻接表结构;

()．写出从元素A出发按广度优先搜索算法遍历此图的元素序列【北京科技大学 五 五 (分)】

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