Go: package main

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

const BIG_COST = 3000

const (
	ST_NOT_YET = iota
	ST_JOINED
)

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	nNodes := scanInt(sc)
	costs := make([][]int, nNodes)

	for r := 0; r < nNodes; r++ {
		costs[r] = make([]int, nNodes)
		for c := 0; c < nNodes; c++ {
			costs[r][c] = scanInt(sc)
		}
	}

	states := make([]int, nNodes)
	minCosts := make([]int, nNodes)

	for i := 1; i < nNodes; i++ {
		minCosts[i] = BIG_COST
	}

	for {
		var u int
		minCost := BIG_COST

		for i := 0; i < nNodes; i++ {
			if states[i] != ST_JOINED && minCosts[i] < minCost {
				minCost = minCosts[i]
				u = i
			}
		}

		// 全てのノードが MST に JOIN できたので終了。
		if minCost == BIG_COST {
			break
		}

		states[u] = ST_JOINED

		for v := 0; v < nNodes; v++ {
			cost := costs[u][v]

			// MST内の u と MST外の v との辺の重みをそれぞれ minCosts[v] として
			// 保存しておく。このうち辺の重みが最小となる v が次のループで MST に JOIN する。
			if states[v] != ST_JOINED && cost != -1 && cost < minCosts[v] {
				minCosts[v] = cost
			}
		}
	}

	sum := 0
	for _, cost := range minCosts {
		sum += cost
	}
	fmt.Println(sum)
}

func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

C++: #include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
    int u, minv;
    int d[MAX], p[MAX], color[MAX];

    for (int i = 0; i < n; i++) {
        d[i] = INFTY;
        p[i] = -1;
        color[i] = WHITE;
    }

    d[0] = 0;

    while (1) {
        minv = INFTY;
        u = -1;
        for (int i = 0; i < n; i++) {
            if (minv > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1) break;
        color[u] = BLACK;
        for (int v = 0; v < n; v++) {
            if (color[v] != BLACK && M[u][v] != INFTY) {
                if (d[v] > M[u][v]) {
                    d[v] = M[u][v];
                    p[v] = u;
                    color[v] = GRAY;
                }
            }
        }
    }
    int sum = 0;
    for (int i = 0; i < n; i++) {
        if (p[i] != -1) sum += M[i][p[i]];
    }

    return sum;
}

int main() {
    cin >> n;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int e; cin >> e;
            M[i][j] = (e == -1) ? INFTY : e;
        }
    }

    cout << prim() << endl;

    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

#define INF 20000000
typedef struct Edge edge;

struct Edge{
  int src,dst,weight;
  Edge(int start,int end,int cost) : src(start),dst(end),weight(cost) {}
};

typedef vector<edge> Edges;

bool operator < (const edge &e,const edge &f){
  return (e.weight != f.weight) ? (e.weight > f.weight) : (e.src != f.src) ? (e.src < f.src) : (e.dst < f.dst);
}

class UnionFind{
public:
  int par[1001];
  int rank[1001];

  UnionFind(){
	for(int i = 0;i < 1001;i++){
	  par[i] = i;
	  rank[i] =1;
	}
  }

  int root(int);
  bool findset(int,int);
  void unionset(int,int);
};

void kruskal(Edges);

int main(int argc,char* argv[]){
  int V;
  Edges es;
  int dist;

  cin >> V;
  for(int i = 0;i < V;i++){
	for(int j = 0;j < V;j++){
	  cin >> dist;
	  if(dist != -1){
		edge e(i,j,dist);
		es.push_back(e);
	  }
	}
  }

  kruskal(es);
  return 0;
}

void kruskal(Edges es){
  priority_queue<edge> que;
  int cost = 0;
  UnionFind uf;
  for(int i = 0;i < (int)es.size();i++)
	que.push(es[i]);

  while(!que.empty()){
	edge e = que.top();que.pop();

	if(!uf.findset(e.src,e.dst)){
	  uf.unionset(e.src,e.dst);
	  cost += e.weight;
	}
  }

  printf("%d\n",cost);
}


int UnionFind::root(int x){
  return (par[x] == x) ? x : root(par[x]);
}

bool UnionFind::findset(int x,int y){
  return root(x) == root(y);
}

void UnionFind::unionset(int x,int y){
  x = root(x);
  y = root(y);

  if(x == y)
	return;

  if(rank[y] < rank[x])
	swap(x,y);
  par[y] = x;
  rank[x] += rank[y];
}

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

using namespace std;
const int INF = 1001001001;

int prim(vector< vector<int> > cost)
{
    vector<int> V(1, 0), T(cost.size());
    for(int i=0;i<cost.size();++i) T[i] = i;
    T[0] = INF;
    int mini, minj, min_cost, ans=0;
    while(V.size() < cost.size())
    {
        min_cost = INF;
        for(int i : V){
            for(int j : T)
            {
                if(j == INF) continue;
                if(cost[i][j] < min_cost)
                {
                    mini = i;
                    minj = j;
                    min_cost = cost[i][j];
                }
            }
        }
        V.push_back(minj);
        T[minj] = INF;
        cost[mini][minj] = cost[minj][mini] = INF;
        ans += min_cost;
    }
    return ans;
}

int main()
{
    int n;
    cin >> n;
    vector<vector<int> > cost(n, vector<int>(n));

    for(int i=0;i<n;++i)
    {
        for(int j=0;j<n;++j)
        {
            cin >> cost[i][j];
            if(cost[i][j] == -1) cost[i][j] = INF;
        }
    }

    cout << prim(cost) << endl;
}

C++: #include <stdio.h>

int n,M[110][110];

int minimum(){
  int color[110],d[110],p[110];
  int i=0,s=0;
  int mincost,v,u;
  while(i<=n){color[i]=0;d[i]=5000;p[i]=-1;i++;}
  d[0]=0;
  while(1){
    mincost = 5000;
    for(i=0;i<n;i++){
      if(color[i] != 2 && d[i]<mincost){
	mincost = d[i];
	u=i;
      }
    }
    if(mincost == 5000){
      break;
    }
    color[u] = 2;
    for(v=0;v<n;v++){
      if(color[v] != 2 && M[u][v]<d[v] && M[u][v]!=-1){
	d[v] = M[u][v];
	p[v] = u;
	color[v] = 1;
      }
    }
  }
  for(i=0;i<n;i++){
    if(d[i]!=5000) s+=d[i];
  }
  return s;
}
int main(void){
  int i,j;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    for(j=0;j<n;j++){
      scanf("%d",&M[i][j]);
    }
  }
  printf("%d\n",minimum());
  return 0;
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

int x[10000][10000];
int MIN[10000];
int MINX = 0;
int MINZ = 0;

int main() {
	memset(MIN, 127, sizeof(MIN));
	int n, a;
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> a;
			x[i][j] = a;
		}
	}
	for(int h=0;h<n;h++){
		memset(MIN, 127, sizeof(MIN));
		MIN[h] = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				for (int k = 0; k < n; k++) {
					if (x[j][k] != -1) {
						MIN[k] = min(MIN[k], x[j][k]);
					}
				}
			}
		}
		for (int i = 0; i < n; i++) {
			MINX += MIN[i];
		}
		MINZ=min(MINZ,MINX);
	}
	cout << MINZ << endl;
	return 0;
}