直接上代码,n为点的数量,m为边的数量
n, m = map(int, input().split())
maxn = 1000
mapp = [[maxn if i != j else 0 for i in range(n)]for j in range(n)]
sel = [0]
nsel = [i for i in range(1, n)]
bian = []
for i in range(m):
a = list(map(int, input().split()))
mapp[a[0]][a[1]] = a[2]
mapp[a[1]][a[0]] = a[2]
while len(nsel):
minm = maxn
for i in sel:
for j in nsel:
if minm > mapp[i][j]:
minm = mapp[i][j]
ii = i
jj = j
sel.append(jj)
nsel.remove(jj)
a = [ii, jj, mapp[ii][jj]]
bian.append(a)
for i in bian:
print(i)