最小生成树

比较适合图中的遍历最小路径 ，这里只有一种方法，是Prim算法实现

int main()
{

int n;
while (cin >> n)
{
vector<vector<int>> dic(n,vector<int>(n,0));

for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
int tmp = 0;
cin >> tmp;
dic[i][j] = tmp;


}
}


vector<int> remark(n, 0);
remark[0] = 1;
vector<int> cost(n, 0);
for (int i = 1; i < n; i++)
{
cost[i] = dic[0][i];
}
vector<int> newpoint(n,0);
newpoint[0] = 1;
int sum = 0;
for (int i = 1; i < n; i++)
{
int min = 1000;
int index = 0;
for (int j = 0; j < n; j++)
{
if (newpoint[j] == 0 && cost[j] < min)
{
min = cost[j];
index = j;
}
}
if (index != 0)
{
newpoint[index] = 1;
sum += min;
for (int j = 0; j < n; j++)
{
if (newpoint[j] == 0 && dic[index][j] < cost[j])
{
cost[j] = dic[index][j];


}
}
}
}
cout << sum << endl;
}


}