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

．对有五个结点{ AB C D E}的图的邻接矩阵

()．画出逻辑图

()．画出图的十字链表存储

()．基于邻接矩阵写出图的深度广度优先遍历序列

()．计算图的关键路径【华南师范大学 三 (分)】

．何为AOE网的始点和终点一个正常的AOE网是否只有一个始点和一个终点？【首都经贸大学 一 (分)】

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