Go: package main

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

const (
	MAX = 100
	INF = 1 << 21
	WHITE = 0
	GRAY = 1
	BLACK = 2
)

var (
	n int
	M [MAX][MAX]int
)

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

	for i := 0; i < n; i++ {
		d[i] = INF
		p[i] = -1
		color[i] = WHITE
	}
	d[0] = 0
	for {
		minv = INF
		u = -1
		for 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 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
				}
			}
		}
	}
	sum := 0
	for i := 0; i < n; i++ {
		if p[i] != -1 {
			sum += M[i][p[i]]
		}
	}
	return sum
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Split(bufio.ScanWords)
	scanner.Scan()
	n, _ = strconv.Atoi(scanner.Text())
	for i := 0; i < n; i++ {
		for j := 0; j < n; j++ {
			scanner.Scan()
			e, _ := strconv.Atoi(scanner.Text())
			if e == -1 {
				M[i][j] = INF
			} else {
				M[i][j] = e
			}
		}
	}
	fmt.Println(prim())
}

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

#define MAX_NUM 10000

using namespace std;

int main(){
	priority_queue<int, vector<int>, less<int> >heap;
	int L,P,N,A[MAX_NUM],B[MAX_NUM],num=0;
	cin>>N>>L>>P;
	for(int i=0;i<N;i++){
		cin>>A[i];
	}
	for(int i=0;i<N;i++){
		cin>>B[i];
	}
	int i=0;
	while(L>P){
		while(A[i]<=P && i<N){
			heap.push(B[i]);
			i++;
		}
		if(heap.empty()==1){
			cout<<-1<<endl;
		}
		P+=heap.top();
		heap.pop();
		num++;
	}
	cout<<num<<endl;
	return 0;
}

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 != 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;
}

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

#define MAX_N 100
#define MAX_EDGE_COST 20000
int Graph[MAX_N+1][MAX_N+1];
int n;

int prim(int initial_vertex) {
  bool visited[n+1];
  for(int i=1;i<=n;i++) visited[i] = false;
  vector<int> vertexes;
  vertexes.push_back(initial_vertex);
  visited[initial_vertex] = true;
  int total_edge_cost = 0;
  while(vertexes.size() <= n) {
    // find minimum edge cost in vertexes
    int minimum_edge_cost = MAX_EDGE_COST;
    int next_v;
    for(int i=0;i<vertexes.size();i++) {
      int v = vertexes[i];
      for(int j=1;j<=n;j++) {
        if(!visited[j]) {
          if(Graph[v][j] != -1) {
            if(Graph[v][j] < minimum_edge_cost) {
              minimum_edge_cost = Graph[v][j];
              next_v = j;
            }
          }
        }
      }
    }
    vertexes.push_back(next_v);
    total_edge_cost += minimum_edge_cost;
  }
  return total_edge_cost;
}

int main() {
  scanf("%d",&n);
  for(int i=1;i<=n;i++) {
    for(int j=1;j<=n;j++) {
      scanf("%d ",&Graph[i][j]);
    }
  }
  printf("%d\n",prim(1));
}

C++: #include <iostream>
using namespace std;
static const int MAX=101;
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 i=0;i<n;i++){
            if(color[i]!=BLACK && M[u][i]!=INFTY){
                if(d[i]>M[u][i]){
                    d[i]=M[u][i];
                    p[i]=u;
                    color[i]=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++){
            cin >> M[i][j];
            if(M[i][j]==-1) M[i][j]=INFTY;
        }
    }
    
    cout << prim() << endl;
    
    return 0;
}

C++: #include <iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int NOT_VISIT = 0;
static const int VISITING = 1;
static const int VISITED = 2;
int n;
int M[MAX][MAX];
int prim()
{
    int minv, u;
    int isVisited[MAX], d[MAX], p[MAX];
    for (int i = 0; i < n; i++) {
	isVisited[i] = NOT_VISIT;
	d[i] = INFTY;
	cout << "d[i]: " << d[i] << endl;
	p[i] = -1;
    }
    d[0] = 0;
    while (1) {
	minv = INFTY;
	cout << "minv: " << minv << endl;
	u = -1;
	for (int i = 0; i < n; i++) {
	    if (minv > d[i] && isVisited[i] != VISITED) {
		u = i;
		minv = d[i];
	    }
	}
	if (u == -1) {
	    break;
	}

	isVisited[u] = VISITED;
	for (int j = 0; j < n; j++) {
	    if (isVisited[j] != VISITED && M[u][j] != INFTY) {
		if (d[j] > M[u][j]) {
		    d[j] = M[u][j];
		    p[j] = u;
		    isVisited[j] = VISITING;
		}
	    }
	}
    }
    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;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
//#include "MyMath.h"
//#include "MyDisjointset.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <stdio.h>
using namespace std;
typedef pair<int, int> P;
const int INF = 2000000000;
int main() {
	int n; cin >> n;
	int m[101][101];
	for (int i = 0; i < n; i++)for (int j = 0; j < n; j++)
		cin >> m[i][j];
	int res = 0;
	int *d = new int[n];
	fill(d, d + n, INF); 
	d[0] = 0;
	bool *visit = new bool [n];
	fill(visit, visit + n, false);
	priority_queue <P, vector<P>, greater<P> > q;
	q.push(P(d[0], 0));
	while (!q.empty()) {
		int f = q.top().first, s = q.top().second;
		visit[s] = true;
		res += f;
		q.pop();
		for (int i = 0; i < n; i++)
			if (!visit[i] && m[s][i] != -1 && d[s] > d[i] + m[s][i]) {
				d[s] = d[i] + m[s][i];
				q.push(P(d[i], i));
			}
	}
	cout << res << endl;
	delete[] d, visit;
	return 0;
}