Re: [問題] 一個圖論的問題

[tkcn (小安)]

http://en.wikipedia.org/wiki/K-minimum_spanning_tree

This problem is known to be NP-complete.

看來只能用 heuristic 囉

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 61.230.172.248