Go: package main

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

const R = 100000000

var sc = bufio.NewScanner(os.Stdin)

var n int
var A [101][101]int

func nextInt() int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return i
}
func prim() int {
	var u, Minimum, sum int
	var d, p, color [101]int

	for i := 0; i < n; i++ {
		d[i] = R
		p[i] = -1
		color[i] = 0
	}
	d[0] = 0

	for {
		Minimum = R
		u = -1
		for i := 0; i < n; i++ {
			if Minimum > d[i] && color[i] != 2 {
				u = i
				Minimum = d[i]
			}
		}
		if u == -1 {
			break
		}
		color[u] = 2
		for j := 0; j < n; j++ {
			if color[j] != 2 && A[u][j] != R {
				if d[j] > A[u][j] {
					d[j] = A[u][j]
					p[j] = u
					color[j] = 1
				}
			}
		}
	}

	for i := 0; i < n; i++ {
		if p[i] != -1 {
			sum += A[i][p[i]]
		}
	}
	return sum
}
func main() {
	sc.Split(bufio.ScanWords)
	n = nextInt()

	for i := 0; i < n; i++ {
		for j := 0; j < n; j++ {
			e := nextInt()
			if e == -1 {
				A[i][j] = R
			} else {
				A[i][j] = e
			}
		}
	}
	fmt.Println(prim())
}

C++: #include<iostream>
#include<algorithm>
#define MAX_E 10000
#define MAX_N 100
using namespace std;
void init_union_find(int);
bool same(int ,int);
void unite(int,int);
struct edge{
  int u,v,cost;
  bool operator < (const edge& e) const{
    if(cost != e.cost) return cost < e.cost;
    else if(u != e.u) return u < e.u;
    else return v < e.v;
  }
};

ostream& operator << (ostream& os,const edge& e){
  os <<e.cost<<e.u<<e.v;
}

int E,n;
edge G[MAX_E];

int A[100][100];

int kruskal(){ 
  sort(G,G + E);
  init_union_find(n);
  int res =0;
  for(int i = 0; i < E; i++){
    edge e = G[i];
    if(!same(e.u,e.v)){
       res += e.cost;
       unite(e.u,e.v);
    }
  }

  return res;
}


int main(){
  cin >> n;
  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      cin >> A[i][j];
      if(A[i][j]==-1){
	continue;
      }
      G[E]=(edge){i,j,A[i][j]};
      E++;
    }
  }
  cout <<kruskal()<<endl;
}




int par[MAX_N] ,rank[MAX_N];

void init_union_find(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]);
  }
}

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]++;
  }
}
bool same(int x,int y){
  return find(x) == find(y);
}

C++: #include<iostream>
#include<algorithm>
#define MAXV 100
#define INF 2001
using namespace std;

int n, total = 0, mine, minj;
int mst[MAXV] = {}; //1 origin
int edge[MAXV][MAXV] = {}; //1 origin

void prim(void);
bool doesFinished(void);

int main() {
	int i, j;
	
	cin >> n;
	for (i = 1; i <= n; i++) {
		
		for (j = 1; j <= n; j++) {
			cin >> edge[i][j];
		}
	}

	mst[1] = 1;
	while (!doesFinished()) {
		prim();
	}

	cout << total << endl;

	return 0;
}

void prim(void) {
	int i, j;
	mine = INF;
	for (i = 1; i <= n; i++) {
		if (mst[i] == 0)continue;
		for (j = 1; j <= n; j++) {
			if (edge[i][j] == -1 || mst[j] == 1)continue;
			if (edge[i][j] < mine) {
				mine = edge[i][j];
				minj = j;
			}
		}
	}
	mst[minj] = 1;
	if(mine != INF)total += mine;
}

bool doesFinished(void) {
	for (int i = 1; i <= n; i++) {
		if (mst[i] == 0)return false;
	}
	return true;
}