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

． 图的D_搜索类似与BFS不同之处在于使用栈代替BFS中的队列 入出队列的操作改为入出栈的操作即当一个顶点的所有邻接点被搜索之后下一个搜索出发点应该是最近入栈(栈顶)的顶点

()．用邻接表做存储结构写一个D_搜索算法(分)

()．用 D_搜索方法的访问次序和相应的生成树当从某顶点出发搜索它的邻接点请按邻接点序号递增序搜索以使答案唯一(分)【中科院 六 (分)】

．令G=(VE)为一个有向无环图编写一个给图G中每一个顶点赋以一个整数序号的算法并满足以下条件若从顶点i至顶点j有一条弧则应使i<j【清华大学 七】

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