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