[理工] 資結與algo 102 交大
資結與演算法第12題
Suppose that all edge weights in a graph G are integers in the range
from 1 to |V|.
How fast can you make Kruskal's algorithm run?
小弟只知道一般的Kruskal's algorithm的時間複雜度
這題不知道如何下手
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.113.46.189
→
02/08 22:17, , 1F
02/08 22:17, 1F
推
02/08 22:24, , 2F
02/08 22:24, 2F
推
02/08 22:58, , 3F
02/08 22:58, 3F
→
02/08 23:02, , 4F
02/08 23:02, 4F
→
02/08 23:08, , 5F
02/08 23:08, 5F
→
02/09 12:46, , 6F
02/09 12:46, 6F