作者ric2k1 (Ric)
看板EE_DSnP
标题Re: [问题] for_each_sink()
时间Wed Jun 3 20:34:49 2009
※ 引述《yea107 (ㄚ隆)》之铭言：
: 我想请问一下在投影片p23~28中
: Depth -First Traversal 的部分
: 其中有两个函式
: for_each_sink(node,sinkList)
这个应该改成 for_each_source(node, sourceList)
我上课有更正, 不过可能没说清楚.
: 和
: for_each_successor(next,_successors)
: 是要做什麽的呢??
: 还有如果按照老师的程式
: →C
: A→B─│
: →D
如图, A is a source, and B is its successors.
: 是不是只会走到C而不会走到D呢??
: 应该是我看不懂...请问从C走到D的机制可以帮我解释一下吗??
: 不好意思...这边我实在不太了解...
When this Node is B, for_each_successor(next,_successors) will recur
on C and D. That is, after C and its subgraph has been traversed (visited),
the recursive call will come back and the for loop will contiue on D.
Hope this is clear.
In homework #6, you need to (revised slide #23):
Circuit::dfs()
{
for_each_po(po, poList)
po->dfs(dfsList);
}
Gate::dfs(List& dfsList)
{
for_each_fanin(fanin, faninList)
fanin->dfs(dfsList);
dfsList.push_back(this);
}
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 61.224.47.135
1F：推 yea107:请问老师为什麽for_each_po後面没有" ; " 呢?? 06/03 22:36
2F：→ ric2k1:';'? 加在哪里? 我上面的 code 只是示意而已, 并非真正 C++ 06/03 23:38
3F：推 yea107:喔喔！！我了解了！！感谢老师~~ 06/03 23:49