[理工] [資結] min spanning tree
If graph G has a cycle with a unique lightest edge e, then e must
be part of some MST.
有人說是T
我覺得是F
原因是出在"some"
應該是for all吧?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 59.121.238.141
→
03/18 17:24, , 1F
03/18 17:24, 1F
推
03/18 17:25, , 2F
03/18 17:25, 2F
推
03/18 17:26, , 3F
03/18 17:26, 3F
推
03/18 17:26, , 4F
03/18 17:26, 4F
→
03/18 17:27, , 5F
03/18 17:27, 5F
→
03/18 17:29, , 6F
03/18 17:29, 6F
→
03/18 17:33, , 7F
03/18 17:33, 7F
推
03/18 17:45, , 8F
03/18 17:45, 8F
推
03/18 18:17, , 9F
03/18 18:17, 9F
→
03/18 18:18, , 10F
03/18 18:18, 10F
→
03/18 18:18, , 11F
03/18 18:18, 11F
→
03/18 18:19, , 12F
03/18 18:19, 12F
推
03/18 18:36, , 13F
03/18 18:36, 13F
推
03/18 18:46, , 14F
03/18 18:46, 14F