作者TommyKSHS (汤米)
看板EE_DSnP
标题Re: [问题] strash ＆ hash
时间Tue Jan 11 19:19:52 2011
※ 引述《BBSealion (海狮)》之铭言：
43
我的做法是
push each PI into a queue q
for head of q
if head is an AIG gate
then if hashkey(head) is in hash table
let tmp = the gate with hashkey(tmp)==hashkey(head)
rewire tmp's fanout to head
update DFS list
replace tmp with head in the hash table
else just insert head into hashtable
for each fanout f of q
if f is in the DFS list and has not been pushed into q
then insert f into q
大概是这样啦 XD
简单的说就是边做 BFS 边把 gate 塞进去 hash table 还有 merge
--
╭═══╤═══╮ ╰═╮ ╭═╯
│ │ │╭═和平，土地，面包═╮ │ │
│ ╭═╧╧╮╤═╤═╮═╤═╤╧╮ │ │
│ │ ││ │ │ │ │ │ ╰═╤═╯
│ │ ││ │ │ │ │ │ │
╰╧╯╰═══╯╰ ╰ ╰ ╰ ╰ ╰ ─╯
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 140.112.244.6
1F：→ scuendless:我是直接按照DFS的顺序往後做 01/11 20:11
2F：→ scuendless:反正DFS保证fanin一定比fanout还要先走到~ 01/11 20:12