Go: // Find the minimum spanning tree by the Kruskal algorithm
// -------------------------------------------------------
// Kruskal(G):
//     A = ∅
//     foreach v ∈ G.V:
//        MAKE-SET(v)
//     foreach (u, v) in G.E ordered by weight(u, v), increasing:
//         if FIND-SET(u) ≠ FIND-SET(v):
//             A = A ∪ {(u, v)}
//             UNION(u, v)
//     return A
//
// Ref: https://en.wikipedia.org/wiki/Kruskal%27s_algorithm

package main

import (
	"bufio"
	"os"
	"sort"
	"strconv"
	"strings"
	"fmt"
	)

var scanner = bufio.NewScanner(os.Stdin)
var (
	matrix [][]int
)

type Edge struct {
	a, b, cost, added int
}
type ByCost []Edge

var edges ByCost

func (a ByCost) Len() int           { return len(a) }
func (a ByCost) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }
func (a ByCost) Less(i, j int) bool { return a[i].cost < a[j].cost }

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		matrix = make([][]int, n)
		for i := range matrix {
			matrix[i] = make([]int, n)
		}
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf_[0])
			b, _ := strconv.Atoi(buf_[1])
			cost, _ := strconv.Atoi(buf_[2])
			matrix[a][b] = cost
			matrix[b][a] = cost
		}
		sum := Kruskal(n)
		fmt.Println(sum)
		if len(edges) > 0 {
			edges = []Edge{}
		}
	}
}

func Kruskal_func(size, edge_num int) int {
	for i := 0; i < size; i++ {
		for j := 0; j < size; j++ {
			if matrix[i][j] > 0 {
				tmp := Edge{i, j, matrix[i][j], 0}
				edges = append(edges, tmp)
			}
		}
	}
	sort.Sort(ByCost(edges))
	UF_Init(edge_num)
	for i := 0; i < edge_num; i++ {
		a := edges[i].a
		b := edges[i].b
		if UF_Find(a) != UF_Find(b) {
			edges[i].added = 1
			UF_Union(UF_Find(a), UF_Find(b))
		}
	}
	sum := 0
	for i := 0; i < edge_num; i++ {
		if edges[i].added != 0 {
			// log.Printf("edge(%d,%d) is added\n", edges[i].a, edges[i].b)
			sum += edges[i].cost
		}
	}
	return sum
}

func Kruskal(size int) int {
	edge_num := 0
	for i := 0; i < size; i++ {
		for j := 0; j < size; j++ {
			if matrix[i][j] > 0 {
				edge_num++
			}
		}
	}
	return Kruskal_func(size, edge_num)
}

/*** Union-Find functions ***/
var UF_Parent []int
var UF_Rank []int

func UF_Init(n int) {
	UF_Parent = make([]int, n)
	UF_Rank = make([]int, n)
	for i := 0; i < n; i++ {
		UF_Parent[i] = i
		UF_Rank[i] = 0
	}
}
func UF_Union(a, b int) {
	if UF_Rank[a] < UF_Rank[b] {
		UF_Parent[a] = b
	} else {
		UF_Parent[b] = a
	}
	if UF_Rank[a] == UF_Rank[b] {
		UF_Rank[a]++
	}
}
func UF_Find(a int) int {
	if UF_Parent[a] == a {
		return a
	}
	return UF_Find(UF_Parent[a])
}
/*** Union-Find functions ***/

C++: #include <iostream>
#include <algorithm>
#include <vector>

#define MAX_N (100)

struct edge { int from, to, cost; };

bool comp ( const edge& e1, const edge& e2 )
{
	return e1.cost < e2.cost;
}

int par[MAX_N];		/// 親
int rank[MAX_N];	/// 木の深さ

/// n要素で初期化
void init ( int n )
{
	for (int i = 0; i < n; ++i) {
		par[i] = i;
		rank[i] = 0;
	}
}

/// 木の根を求める
int find ( int x ) 
{
	if (par[x] == x) {
		return x;
	}
	else {
		return par[x] = find(par[x]);
	}
}

/// xとyの属する集合を合併
void unite ( int x, int y )
{
	x = find(x);
	y = find(y);

	if (x == y) { return; }

	if (rank[x] < rank[y]) {
		par[x] = y;
	}
	else {
		par[y] = x;
		if (rank[x] == rank[y]) { ++rank[x]; }
	}
}

/// xとyが同じ集合に属するか否か
bool same ( int x, int y )
{
	return find(x) == find(y);
}

using namespace std;

int main ( void )
{
	int n, m;

	while (cin >> n >> m, n | m) {
		vector<edge> es(m);
		for (int i = 0; i < m; ++i) {
			edge& e = es[i];
			cin >> e.from >> e.to >> e.cost;
		}

		sort(es.begin(), es.end(), comp);
		init(n);
		int ans = 0;
		for (int i = 0; i < n; ++i) {
			edge e = es[i];
			if (!same(e.from, e.to)) {
				unite(e.from, e.to);
				ans += e.cost;
			}
		}

		cout << ans << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>

#define MAX_N (100)

struct edge { int from, to, cost; };

bool comp ( const edge& e1, const edge& e2 )
{
	return e1.cost < e2.cost;
}

int par[MAX_N];		/// 親
int rank[MAX_N];	/// 木の深さ

/// n要素で初期化
void init ( int n )
{
	for (int i = 0; i < n; ++i) {
		par[i] = i;
		rank[i] = 0;
	}
}

/// 木の根を求める
int find ( int x ) 
{
	if (par[x] == x) {
		return x;
	}
	else {
		return par[x] = find(par[x]);
	}
}

/// xとyの属する集合を合併
void unite ( int x, int y )
{
	x = find(x);
	y = find(y);

	if (x == y) { return; }

	if (rank[x] < rank[y]) {
		par[x] = y;
	}
	else {
		par[y] = x;
		if (rank[x] == rank[y]) { ++rank[x]; }
	}
}

/// xとyが同じ集合に属するか否か
bool same ( int x, int y )
{
	return find(x) == find(y);
}

using namespace std;

int main ( void )
{
	int n, m;

	while (cin >> n >> m, n | m) {
		vector<edge> es;
		for (int i = 0; i < m; ++i) {
			edge e;
			cin >> e.from >> e.to >> e.cost;
			bool hit = false;
			for (int j = 0; j < es.size() && !hit; ++j) {
				if ((e.from == es[j].from && e.to == es[j].to) ||
					(e.from == es[j].to && e.to == es[j].from)) {
						es[j].cost = min(es[j].cost, e.cost);
						hit = true;
				}
			}
			if (!hit) {
				es.push_back(e);
			}
		}

		sort(es.begin(), es.end(), comp);
		init(n);
		int ans = 0;
		for (int i = 0; i < n; ++i) {
			edge e = es[i];
			if (!same(e.from, e.to)) {
				unite(e.from, e.to);
				ans += e.cost;
			}
		}

		cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
#define pb(x) push_back(x)
#define ms(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10) 
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
struct edge{ int from, to, cost; };

int par[1000];

int find(int x)
{
	if (par[x] == x) return x;
	else return par[x] = find(par[x]);
}

void unite(int x, int y)
{
	x = find(x); y = find(y);
	par[x] = y;
}

bool same(int x, int y)
{
	return find(x) == find(y);
}

void init_UFT(int n)
{
	REP(i, n)
	{
		par[i] = i;
	}
}

bool comp(const edge& e1, const edge& e2)
{
	return e1.cost < e2.cost;
}

vector<edge> es;
int main()
{
	int n, m;
	while (cin >> n >> m, n)
	{
		init_UFT(n);
		es.clear();
		int a, b, c;
		REP(i, m)
		{
			cin >> a >> b >> c;
			edge e = { a, b, c };
			es.push_back(e);
		}
		sort(ALL(es), comp);
		int sum = 0;
		REP(i, es.size())
		{
			if (!same(es[i].from, es[i].to))
			{
				unite(es[i].from, es[i].to);
				sum += es[i].cost;
			}
		}
		cout << sum << endl;
	}

	return 0;
}

C++: #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#define INF 1<<29
using namespace std;
int V;
int cost[1000][1000],mincost[1000];
bool used[1000];
bool connect[1000];

int prime()
{
  int res = 0;
  for(int i=0;i<V;++i)
    {
      mincost[i] = INF;
      used[i]=false;
    }

  mincost[0]=0;
  
 
  while(true)
    {
 int v = -1;
      for(int i=0;i<V;i++)
	{
	  if(connect[i] && !used[i] && (v == -1 ||  mincost[i] < mincost[v]))v = i;
	}
      
      if(v == -1)break;
      used[v] = true;
      res += mincost[v];
      
      for(int i=0;i<V;i++)
	{
	  mincost[i] = min(mincost[i],cost[v][i]);
	}

    }
  
  return res;
}




int main()
{
  int m,a,b;

  while(true)
    {
      cin >> V >> m;
      if(V == 0 && m == 0)break;
      for(int i=0;i<V;i++)for(int j=0;j<V;j++)cost[i][j] = INF;
      memset(connect,false,sizeof(connect));
      for(int i=0;i<m;i++)
	{
	  cin >> a >> b;
	  cin >> cost[a][b];
	  cost[b][a] = cost[a][b];
	  connect[a] = true;
	  connect[b] = true;
	}
      cout << prime() << endl;
    }
}