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<ostream>
#include<cstdio>
using namespace std;
static const int WHITE=0;
static const int GRAY=1;
static const int BLACK=2;
static const int INFTY=(1<<21);
int n,H[100][100];
int p()
{
    int u,minv,d[100],p[100],c[100];
    for(int i=0;i<n;i++)
    {
        d[i]=INFTY;
        p[i]=-1;
    }
    d[0]=0;
    while(1)
    {
        minv=INFTY;
        u=-1;
        for(int i=0;i<n;i++)
        {
            if(minv>d[i]&&c[i]!=BLACK)
            {
                u=i;
                minv=d[i];
            }
        }
        if(u==-1) break;
        c[u]=BLACK;
        for(int v=0;v<n;v++)
        {
            if(c[v]!=BLACK&&H[u][v]!=INFTY)
            {
                if(d[v]>H[u][v])
                {
                    d[v]=H[u][v];
                    p[v]=u;
                    c[v]=GRAY;
                }
            }
        }
    }
    int sum=0;
    for(int i=0;i<n;i++)
    {
        if(p[i]!=-1) sum+=H[i][p[i]];
    }
    return sum;
}
int main()
{
    int a;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
    {
        scanf("%d",&a);
        H[i][j]=(a==-1)?INFTY:a;
    }
    printf("%d\n",p());
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define int long long

struct edge{
  int u, v, cost;
  bool operator < (edge const& other){
	  return cost < other.cost;  
	}	
};

const int N = 100 + 11;
int p[N], sz[N];
vector<edge> edge_list;
vector<edge> ret;
int weight;

int get(int x){
  if (p[x] == x) return x;
  return p[x] = get(p[x]);	
}

void unite(int x, int y){
  x = get(x), y = get(y);
  if (sz[x] < sz[y]) swap(x, y);
  sz[x] += sz[y];
  p[y] = x;
}

void KruskalMST( vector<edge> &edge_list){
	sort(edge_list.begin(), edge_list.end());
	for(auto it : edge_list){
	  if (get(it.u)  != get(it.v)){
	    unite(it.u, it.v);
	    weight += it.cost;
	    ret.push_back(it);	  
     }	
  }	
}

int32_t main(){
  	int n;
  	cin >> n;
  	vector<edge> g;
  	for(int i = 0; i < n; i++){
	  p[i] = i;
	  sz[i] = 0;	
	}
  	for (int i = 0; i < n; i++){
	  for (int j = 0; j < n; j++){
		  int x;
		  cin >> x;
		  if ( x != -1) g.push_back({i, j, x});  
	  }	
	}
  KruskalMST(g);
  cout << weight << endl;
}

C++: #include <iostream>
using namespace std;
#define MAX 100
#define INFINITY (1<<30)
enum{
	white=0,
	gray=1,
	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]=INFINITY;
		p[i]=-1;
		color[i]=white;
	}
	d[0]=0;
	while(1){
		minv=INFINITY;
		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]!=INFINITY){
				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;
	int e;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cin>>e;
			if(e==-1)	m[i][j]=INFINITY;
			else	m[i][j]=e;
		}
	}
	cout<<prim()<<endl;
	return 0;
}