Re: [問題] 又是看書的問題

作者: saladim (殺拉頂)   2011-07-26 08:17:30
※ 引述《saladim (殺拉頂)》之銘言:
: 看書又看到卡住 請大家幫忙解惑阿~~~~
: 所看的書是 Algorithms in C++ by Robert Sedgwick, 第18章的DFS小節(18.4)
: 裡面提到:
: We refer to a link from v to w in a DFS tree that represents a tree edge
: as :
: A tree link if w is unmarked
: A parent link if st[w] is v <
作者: firejox (Tangent)   2011-07-26 09:12:00
你為什麼會有第3步...你沒有標記...你應該要標記已走過的...

Links booklink

Contact Us: admin [ a t ] ucptt.com