[理工] 104 台大資演
倒數第二題,問Prim's演算法worst case的複雜度
點數V, 邊數E=V^1.5
(1) 沒有使用任何data structure
(2) 使用loser tree,leaf是cost最小的邊
(3) 使用Fibonacci Heap
大家這題寫什麼呢?
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 211.23.164.210
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1423487558.A.C73.html
→
02/09 21:35, , 1F
02/09 21:35, 1F
推
02/09 21:37, , 2F
02/09 21:37, 2F
感謝 已補
推
02/09 21:42, , 3F
02/09 21:42, 3F
※ 編輯: mkchiun1028 (211.23.164.210), 02/09/2015 21:44:07
→
02/09 21:43, , 4F
02/09 21:43, 4F
→
02/09 21:44, , 5F
02/09 21:44, 5F
→
02/09 21:46, , 6F
02/09 21:46, 6F
→
02/09 21:48, , 7F
02/09 21:48, 7F
→
02/09 21:49, , 8F
02/09 21:49, 8F
→
02/09 21:50, , 9F
02/09 21:50, 9F
→
02/09 22:01, , 10F
02/09 22:01, 10F
→
02/09 22:02, , 11F
02/09 22:02, 11F
推
02/09 23:27, , 12F
02/09 23:27, 12F
→
02/09 23:42, , 13F
02/09 23:42, 13F
推
02/10 00:05, , 14F
02/10 00:05, 14F
討論串 (同標題文章)