模板题,不想多说,虽然题目给了一些代码,但是我觉得太麻烦了,各位直接看代码吧,我相信大家能够理解,实在理解不了,可以私聊我
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <cstring>
#define int long long
#define INF 0X3f3f3f3f
#define fr(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
int dis[100][100];
int d[100];
int mp[100];
int flag[100];
map<char,int>mp1;
map<int,char>mp2;
int m;
int n;
void Prime(int v)
{
//int sum;
//sum = 0;
for(int i = 1; i <= n; i++){
d[i] = dis[v][i];
mp[i] = v;
}
d[v] = 0;
flag[v] = 1;
int k,p=-1;
for(int i = 1; i < n; i++)
{
int minn = INF;
for(int j = 1; j <= n; j++)
{
if(minn > d[j] && flag[j] == 0)
{
k = j;
minn = d[j];
}
}
flag[k] = 1;
if(k==p){
return;
}
p=k;
cout <<"("<<mp2[mp[k]]<<","<<mp2[k]<<")";
//sum += d[k];
for(int j =1; j <= n; j++)
{
if(flag[j] == 0 && d[j] > dis[k][j]){
mp[j]= k;
d[j] = dis[k][j];
}
}
}
//return sum;
}
signed main(){
cin >> n >> m;
fr(i,0,n){
char A;
cin >> A;
mp1[A]=i+1;
mp2[i+1]=A;
}
int t = m;
memset(dis,INF,sizeof(dis));
while(t--){
char x,y;
int w;
cin >> x >> y >> w;
dis[mp1[x]][mp1[y]]=w;
dis[mp1[y]][mp1[x]]=w;
}
fr(i,0,n){
if(!flag[i+1]){
Prime(i+1);
}
}
}