． 圖的D_搜索類似與BFS不同之處在於使用棧代替BFS中的隊列 入出隊列的操作改為入出棧的操作即當一個頂點的所有鄰接點被搜索之後下一個搜索出發點應該是最近入棧(棧頂)的頂點
()．用鄰接表做存儲結構寫一個D_搜索算法(分)
()．用 D_搜索方法的訪問次序和相應的生成樹當從某頂點出發搜索它的鄰接點請按鄰接點序號遞增序搜索以使答案唯一(分)【中科院 六 (分)】
．令G=(VE)為一個有向無環圖編寫一個給圖G中每一個頂點賦以一個整數序號的算法並滿足以下條件若從頂點i至頂點j有一條弧則應使i<j【清華大學 七】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23089.html
