Prime最小生成树

#include <iostream>
#include <queue>
#include<vector>
using namespace std;
int graph[8][8];
#include<string>
bool visited[8];
int dis[8];
int pre[8];
const int minn=127;

void prim(int n)
{
memset(visited,false,sizeof(visited));
for (int i=1;i<=n;i++)
{
dis[i]=minn;
}
visited[1]=true;
dis[1]=0;
for (int i=1;i<=n;i++)
{
dis[i]=graph[1][i];
}
int sum=0;
for (int k=1;k<n;k++)
{
int point=0;
int min_flag=minn;
for (int i=1;i<=n;i++)
{
if (!visited[i]&&dis[i]<min_flag)
{
point=i;
min_flag=dis[i];
}
}
visited[point]=true;
sum+=dis[point];
for (int i=1;i<=n;i++)
{
if (graph[point][i]<dis[i]&&!visited[i])
{
dis[i]=graph[point][i];
}
}
}
cout<<sum<<endl;

}

int _tmain(int argc, _TCHAR* argv[])
{
for (int i=1;i<=5;i++)
{
for (int j=1;j<=5;j++)
{
graph[i][j]=minn;
}
}
graph[1][2]=8;
graph[1][5]=5;
graph[1][4]=1;
graph[2][1]=8;
graph[2][5]=7;
graph[2][3]=6;
graph[3][2]=6;
graph[3][5]=10;
graph[3][4]=9;
graph[4][1]=1;
graph[4][5]=3;
graph[4][3]=9;
graph[5][1]=5;
graph[5][2]=7;
graph[5][3]=10;
graph[5][4]=3;
prim(5);
//spfa(graph,0,6,7);
return 0;
}