Go: package main

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

const (
	WHITE int = iota
	GRAY
	BLACK
)

type graph struct {
	G [][]int
	C []int
	D []int
	P []int
}

var INFTY = 1 << 32

func constructGraph() *graph {
	sc := bufio.NewScanner(os.Stdin)
	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())

	g := make([][]int, n)
	c := make([]int, n)
	d := make([]int, n)
	p := make([]int, n)

	for i := 0; i < n; i++ {
		sc.Scan()
		fields := strings.Fields(sc.Text())
		g[i] = toIntSlice(fields)
	}

	return &graph{g, c, d, p}
}

func (g *graph) initMst() {
	for i := 0; i < len(g.G); i++ {
		g.C[i] = WHITE
		g.D[i] = INFTY
	}
	g.D[0] = 0
	g.P[0] = -1
}

func (g *graph) primMst() int {
	g.initMst()

	var u int
	for {
		mincost := INFTY
		for i := 0; i < len(g.G); i++ {
			if g.C[i] != BLACK && g.D[i] < mincost {
				mincost = g.D[i]
				u = i
			}
		}

		if mincost == INFTY {
			break
		}

		g.C[u] = BLACK

		for i := 0; i < len(g.G); i++ {
			if g.C[i] != BLACK && g.existEdge(u, i) {
				if g.G[u][i] < g.D[i] {
					g.D[i] = g.G[u][i]
					g.P[i] = u
				}
			}
		}
	}

	totalCost := 0
	for _, cost := range g.D {
		totalCost += cost
	}
	return totalCost
}

func (g *graph) existEdge(u, v int) bool {
	return g.G[u][v] != INFTY && g.G[v][u] != INFTY
}

func toIntSlice(s []string) []int {
	a := make([]int, len(s))
	for i, v := range s {
		num, _ := strconv.Atoi(v)
		if num == -1 {
			num = INFTY
		}
		a[i] = num
	}
	return a
}

func main() {
	g := constructGraph()
	fmt.Println(g.primMst())
}

C++: #include<iostream>
#include<algorithm>
#define INF 99999
using namespace std;

int G[110][110] = {};

int prim(int n)
{
    int mini[110];
    int used[110];

    //init
    for(int i = 0;i < n;i++){
        mini[i] = INF;
        used[i] = 0;
    }
    mini[0] = 0;
    int ans = 0;

    while(true)
    {
        int v = -1;
        for(int i = 0;i < n;i++){
            if(!used[i] && (v == -1 || mini[i] < mini[v])) v = i;
        }
        if(v == -1) break;
        //ans = -1;

        used[v] = 1;
        ans += mini[v];
        //cout << ans << endl;

        for(int i = 0;i < n;i++){
            mini[i] = min(mini[i], G[v][i]);
        }
    }
    return ans;
}

int main()
{
    int n;
    cin >> n;

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

    cout << prim(n) << endl;
    return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<vector<int> > vvi;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<string, int> psi;
typedef pair<int, int> pii;
#define rep(i,s,n) for(int i = (s); i < (n); i++)
#define loop(i) for(int i = 0;true; i++)
#define all(x) (x).begin(), (x).end()
#define yn(f) (f?"yes":"no")
#define YN(f) (f?"YES":"NO")
#define Yn(f) (f?"Yes":"No")
#define mn 1000000007
#define INT32_MAX 2147483647

int main() {
	int N;
	cin >> N;
	vvi A(N,vi(N));
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			cin >> A[i][j];
			if (A[i][j] == -1)A[i][j] = INT32_MAX;
		}
	}
	vi used(N, 0);
	vi mincost(N,INT32_MAX);
	int total = 0;
	mincost[0] = 0;
	while (true) {
		int minIndex = -1;
		for (int u = 0; u < N; u++) {
			if (used[u]==0 && (minIndex == -1 || mincost[u] < mincost[minIndex])) minIndex = u;
		}
		if (minIndex == -1) break;
		used[minIndex] = 1;
		total += mincost[minIndex];
		for (int u = 0; u < N; u++)
		{
			mincost[u] = min(mincost[u], A[minIndex][u]);
		}
	}
	cout << total << endl;
};

C++: #include <iostream>
using namespace std;
 
int n;
int a[101][101];
int flg[101];
int t[101];
int sum = 0;
 
void visit(){
  int ima = 0;
  int mine = 100000000;
   
   
  for(int k=0;k<n-1;k++) {
    mine = 10000000;
    for(int i=0;i<n;i++) {
      if(flg[i] == 0 && mine > t[i]) {
    mine = t[i];
    ima = i;
      }
    }
    sum += mine;
    flg[ima] = 1;
     
    for(int i=0;i<n;i++) 
      if(a[ima][i] != -1) 
    if(t[i] > a[ima][i] ) t[i] = a[ima][i];
     
     
  }
}
 
int main() {
 
  cin >> n;
 
  for(int i=0;i<n;i++) 
    for(int j=0;j<n;j++) 
      cin >> a[i][j];
   
  for(int i=0;i<n;i++) {
    flg[i] = 0;
    t[i] = 100000000;
  }
   
  t[0] = 0;
  flg[0] = 1;
  for(int i=0;i<n;i++) 
    if(a[0][i] != -1) t[i] = a[0][i];
 
  visit();
 
  cout << sum << endl;
  
  return 0; 
   
}

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

int prim();
int Infty = 20000000;

int n,*d,*p,**G;
string *color;

int main(){
	cin>>n;
	d = new int[n]; p = new int[n];
	d = d-1; p = p-1;
	G = new int*[n]; for(int i=0;i<n;i++) G[i] = new int[n];
	G = G-1; for(int i=1;i<=n;i++) G[i] = G[i]-1;
	color = new string[n]; color = color-1;

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

	cout<<prim()<<endl;

	delete [] (d+1); delete [] (p+1);
	for(int i=1;i<=n;i++) delete [] (G[i]+1); delete [] (G+1);
	delete [] (color+1);
}

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

	while(1){
		int u , mincost = Infty;
		for(int i=1;i<=n;i++){
			if(color[i]!="BLACK"&&d[i]<mincost){
				mincost = d[i];
				u = i;
			}
		}

		if(mincost==Infty) break;

		color[u] = "BLACK";

		for(int v=1;v<=n;v++){
			if(color[v]!="BLACK" && G[u][v]!=-1){
				if(G[u][v]<d[v]){
					d[v] = G[u][v];
					p[v] = u;
					color[v] = "GRAY";
				}
			}
		}
	}

	int sum = 0;
	for(int i=1;i<=n;i++){
		sum += d[i];
	}
	return sum;
}

C++: #include <iostream>
using namespace std;
static const int MAX = 100;
static const int INF = (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;
  // d: TとT-Vをつなぐ重みが最小の辺の重み
  // p: p[v]に頂点vの親
  int d[MAX], p[MAX], color[MAX];

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

  d[0] = 0;

  while (1) {
    minv = INF;
    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] != INF) {
        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) ? INF : e;
    }
  }

  cout << prim() << endl;
}

C++: #include <iostream>
using namespace std;
#define N 100
#define INF 9999999
int M[N][N];
int mincost[N];
bool used[N];
int n;
int prim(){
  for(int i=0;i<n;i++){
    used[i]=false;
    mincost[i]=INF;
  }
  mincost[0]=0;
  int res=0;

  while(true){
    int v=-1;
    for(int i=0;i<n;i++){
      if(!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<n;i++){
      mincost[i]=min(mincost[i], M[v][i]);
    }
  }
  return res;
}
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)?INF:e;
    }
  }
  cout<<prim()<<"\n";

}