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>
#include<stack>
#include<queue>
using namespace std;
int main(){
	int n, a, sum = 0;
	int temp = 1000000;
	int n1, n2;
	int r1[101] = {0}, r2[101] = { 0 };
	int m[101][101] = { 0 };
	cin >> n;
	for (int i = 0; i < n; i++){
		for (int l = 0; l < n; l++){
			cin >> a;
			m[i][l] = a;
		}
	}
	for (int i = 0; i < n-1; i++){
		for (int l = 0; l < n; l++){
			cout << m[i][l] << "   " << i <<endl;

			if (m[i][l] == -1) continue;
			if (m[i][l] < temp&&r1[l] == 0 && r2[i] == 0){
				temp = m[i][l];
				n1 = i; n2 = l;
			}
		}
		if (temp != 1000000){
			sum += temp;
			cout << i + 1 << endl;
			cout << temp <<endl;
			r1[n1] = -1; r2[n2] = -1;
			cout << n1  << n2 << endl;
			n1 = 0; n2 = 0;
			temp = 1000000;
		}
	}
	cout << sum << endl;
	return 0;
}*/
/*
5
-1 2 3 1 -1
2 -1 -1 4 -1
3 -1 -1 1 1
1 4 1 -1 3
-1 -1 1 3 -1
*/
#include<queue>
#include<stack>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define WHITE 0
#define BLACK 1
#define GRAY 2
#define INFTY 1000000
int color[101];
int m[101][101];
int d[101];
int p[101];
int mincost = INFTY;
int n;
int yy;


void prim(int u){
	while (1){
		mincost = INFTY;
		for (int i = 0; i < n - 1; i++){
			if (color[i] != BLACK&&d[i] < mincost){
				mincost = d[i];
				u = i;
			}
		}
		if (mincost == INFTY) break;
		color[u] = BLACK;
		for (int v = 0; v < n - 1; v++){
			if (color[v] != BLACK&&m[u][v] != INFTY){
				if (m[u][v] < d[v]){
					d[v] = m[u][v];
					p[v] = u;
					color[v] = GRAY;
				}
			}
		}
	}
}
int main(){
	int a[10] = { 0 };
	for (int i = 0; i < 101; i++){
		color[i] = INFTY; d[i] = INFTY; p[i] = -1;
	}
	for (int i = 0; i < 101; i++){
		for (int l = 0; l < 101; l++){
			m[i][l] = 0;
		}
	}
	cin >> n;
	for (int i = 0; i < n; i++){
		for (int l = 0; l < n; l++){
			cin >> m[i][l];
		}
	}
	prim(0);
	int sum = 0;
	for (int i = 0; i < n; i++){
		sum += p[i];
	}
	cout << sum*(-1) << endl;
	return 0;
}

C++: #include<stdio.h>

#define INFTY (1<<21)
#define MAX 100
#define WHITE 0
#define GRAY 1
#define 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(){
  
  scanf("%d",&n);

  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      int e;
      scanf("%d",&e);
      M[i][j] = (e == -1) ? INFTY : e;
    }
  }

  printf("%d\n",prim());

  return 0;
}

C++: #include <tuple>
#include <iostream>
#include <algorithm>
using namespace std;
int P[10010]; 
tuple<int,int,int> a[10010];
void init(int N) { 
    for (int i=0; i<N; ++i) P[i] = i;
}
int root(int a) { 
    if (P[a] == a) return a; 
    return (P[a] = root(P[a])); 
}
bool is_same_set(int a, int b) {
    return root(a) == root(b);
}
void unite(int a, int b) {
    P[root(a)] = root(b);
}
int main(void){
    int n,value;
    cin >> n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cin >> value;
            a[n*i+j] = make_tuple(value,i,j);
        }
    }
    init(n*n);
    sort(a,a+n*n);
    int sum =0;
    int x,y;
    for(int i =0;i<n*n;i++){
        x = get<1>(a[i]);
        y = get<2>(a[i]);
        if(is_same_set(x,y)!=1){
            if(get<0>(a[i])!=-1){
                sum += get<0>(a[i]);
                unite(x,y);
            }
        }
    }
    cout << sum << endl;
}

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

int color(std::vector<std::vector<int> > v) {
	std::vector<int> color(v.size(), 0);
	int count = 0, color_count = 1;
	for (int i = 0; i <= 2000; i++) {
		for (size_t j = 0; j < v.size(); j++) {
			for (size_t k = j + 1; k < v.size(); k++) {
				if (v[j][k] == i && ((color[k] == 0 || color[j] == 0) || (color[k] != color[j]))) {
					if (color[k] == 0) {
						if (color[j] != 0) {
							color[k] = color[j];
						} else {
							color[k] = color[j] = color_count;
							color_count++;
						}
					} else {
						if (color[j] == 0) {
							color[j] = color[k];
						} else {
							int num = color[j];
							std::replace(color.begin(), color.end(), num, color[k]);
						}
					}
					count += i;
				}
			}
		}
	}
	return count;
}

int main() {
	int num;
	std::cin >> num;

	std::vector<std::vector<int> > v(num);

	for (int i = 0; i < num; i++) {
		for (int j = 0; j < num; j++) {
			int n;
			std::cin >> n;
			v[i].push_back(n);
		}
	}

	std::cout << color(v) << std::endl;

	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
const int MAXN = 100+7;
const int INF = 2e3+7;
int m[MAXN][MAXN];
int sum;
set<int> notin;
set<int> isin;
bool visit[MAXN];
void printset(set<int> r)
{

    for(set<int>::iterator it = r.begin(); it != r.end(); it++)
    {
        printf("%d,", *it);
    }
    printf("\n");
}
void prim(int root)
{
    isin.insert(root);
    notin.erase(root);
    visit[root] = true;
    while(!notin.empty())
    {
        int u;
        int min_e = INF;
        for(set<int>::iterator it = isin.begin(); it!=isin.end(); it++)
        {
            int r = *it;
            int i;
            for(set<int>::iterator it2 = notin.begin(); it2!=notin.end(); it2++)
            {
                int h = *it2;
                if(m[h][r]<min_e && m[h][r]!=-1 && visit[h] == false)
                {
                    min_e = m[h][r];
                    u = h;
                }

            }
        }
        isin.insert(u);
        notin.erase(u);
        visit[u] = true;
        sum+=min_e;
    }
}
int main()
{
//    freopen("../in.txt", "r", stdin);
    memset(visit, false, sizeof(visit));
    int n;
    scanf("%d", &n);
    int i, j;
    for(i = 0; i < n; i++)
    {
        for(j = 0; j < n; j++)
        {
            scanf("%d", &m[i][j]);
        }
        notin.insert(i);

    }
    sum = 0;
    prim(0);
    printf("%d\n", sum);
    return 0;
}