Picnic Planning
题意翻译
给定一张N个点M条边的无向图，求出无向图的一棵最小生成树，满足一号节点的度数不超过给定的整数s。保证 N <= 30
题目描述
[problemUrl]: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=448&page=show_problem&problem=4312
[PDF](https://uva.onlinejudge.org/external/15/p1537.pdf)