邻接表实现PRIM算法(C++)

<div style="color: rgb(70, 70, 70); font-family: 'Microsoft YaHei', 'Helvetica Neue', SimSun; font-size: 14px; line-height: 21px; text-indent: 28px;"><div style="color: rgb(70, 70, 70); font-family: 'Microsoft YaHei', 'Helvetica Neue', SimSun; font-size: 14px; line-height: 21px; text-indent: 28px;"><span style="color: rgb(255, 126, 0); word-wrap: normal; word-break: normal;"><span style="word-wrap: normal; word-break: normal; line-height: 72px;">参考张宪超老师《数据结构、算法及应用》</span></span></div><div style="color: rgb(70, 70, 70); font-family: 'Microsoft YaHei', 'Helvetica Neue', SimSun; font-size: 14px; line-height: 21px; text-indent: 28px;"><span style="color: rgb(237, 28, 36); word-wrap: normal; word-break: normal; line-height: 30px; font-size: 20px;"><strong>原理:</strong></span></div><div style="color: rgb(70, 70, 70); font-family: 'Microsoft YaHei', 'Helvetica Neue', SimSun; font-size: 14px; line-height: 21px; text-indent: 28px;">G=是一个连通的带权无向图。Prim算法通过不断地增加生成树的顶点来得到最小生成树。在算法的任一时刻，一部分顶点已经添加到生成树的顶点集合中，而其余顶点尚未加到生成树中。此时，<span style="text-decoration: underline;"><span style="color: rgb(255, 126, 0); word-wrap: normal; word-break: normal;">Prim算法通过选择边<span v="">，使得<span v="">的权值是所有u（起点）在生成树中，但v（终点）不在生成树中的边的权值最小者</span></span>，从而找到新的顶点v把她添加到生成树中。</span></span></div><div style="color: rgb(70, 70, 70); font-family: 'Microsoft YaHei', 'Helvetica Neue', SimSun; font-size: 14px; line-height: 21px; text-indent: 28px;">
</div><div style="color: rgb(70, 70, 70); font-family: 'Microsoft YaHei', 'Helvetica Neue', SimSun; font-size: 1