最小树-图的最短路径

#include <iostream>
#include <cstring>
#define INF 1000000
using namespace std;
bool visited[200] = {false};
int dist[200];
int graph[200][200];int Dijkstra(int, int, int);

int Prim(int a, int v)
{
	int min_, s, ans; // s record the min vertex
	dist[a] = 0;
	visited[a] = true;
	for (int i = 1; i < v; i++)
		dist[i] = graph[a][i];
	while (true)
	{
		min_ = INF, s = -1;
		for (int i = 0; i < v; i++)
			if (!visited[i])
				if (dist[i] < min_)
					min_ = dist[i], s = i;
		
		if (s == -1)
			break;
		visited[s] = true;
		for (int i = 0; i < v; i++)
		{
			if (!visited[i] && graph[s][i] != INF && graph[s][i] < dist[i])
				dist[i] = graph[s][i];
		}
	}
	ans = 0;
	for (int i = 0; i < v; i++)
		ans += dist[i];
	return ans;
}

int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int vertexs, sides;
		int v1, v2, w;
		memset(graph, INF, sizeof(graph));
		memset(visited, false, sizeof(visited));
		memset(dist, INF, sizeof(dist));
		cout << "顶点数： "; cin >> vertexs;
		cout << "边数： "; cin >> sides;
		
		for (int i = 0; i < sides; i++)
		{
			cin >> v1 >> v2 >> w;
			graph[v1][v2] = w;
			graph[v2][v1] = w;
		}
		int road = Prim(0, vertexs);
		cout << road << endl;
	}
}