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

．有向图的邻接表存储如下()．画出其邻接矩阵存储()．写出图的所有强连通分量()．写出顶点a到顶点i的全部简单路径【东北大学 一 (分)】

．试用下列三种表示法画出网G 的存储结构并评述这三种表示法的优缺点

()．邻接矩阵表示法; ()．邻接表表示法; ()．其它表示法【华中理工大学 三(分)】

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