Re: [問題] for_each_sink()
※ 引述《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
推
06/03 22:36, , 1F
06/03 22:36, 1F
→
06/03 23:38, , 2F
06/03 23:38, 2F
推
06/03 23:49, , 3F
06/03 23:49, 3F
討論串 (同標題文章)
本文引述了以下文章的的內容：
完整討論串 (本文為第 2 之 2 篇)：