The connected augmentation of weighted graphs is NP hard problem that has been proved.
加权图的连通扩充问题已被证明是NP完全问题。
youdao
应用推荐
模块上移
模块下移
不移动