Go: package main

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

const (
	MAX_N      = 200
	MAX_WEIGHT = 2000
)

type Edge struct {
	start  int
	end    int
	weight int
}

type ShortestInfo struct {
	edges    []Edge
	shortest int
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	shortestList := make([]ShortestInfo, n)
	for i := 1; i < n; i++ {
		shortestList[i] = ShortestInfo{edges: []Edge{}, shortest: MAX_N*MAX_WEIGHT + 1}
	}

	adjacentMatrix := make([][]int, n)
	for i := 0; i < n; i++ {
		adjacentMatrix[i] = make([]int, n)
		for j := 0; j < n; j++ {
			v, err := nextInt(sc)
			if err != nil {
				panic(err)
			}
			adjacentMatrix[i][j] = v
		}
	}

	mst([]int{1}, shortestList, adjacentMatrix)
	fmt.Println(shortestList)
	fmt.Println(calculateMinWeight(shortestList))
}

func calculateMinWeight(shortestList []ShortestInfo) int {
	visitedList := make([]bool, len(shortestList))
	visitedList[0] = true
	sumWeight := 0
	for !visitedAll(visitedList) {
		shortestInfo := shortestList[0]
		shortestList = shortestList[1:]
		edges := shortestInfo.edges
		for _, edge := range edges {
			if !visitedList[edge.end-1] {
				visitedList[edge.end-1] = true
				sumWeight += edge.weight
			}
		}
	}
	return sumWeight
}

func visitedAll(visitedList []bool) bool {
	for _, v := range visitedList {
		if !v {
			return false
		}
	}
	return true
}

func mst(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]int) {
	for len(nodeStack) > 0 {
		currentNode := nodeStack[0]
		nodeStack = nodeStack[1:]
		currentShortest := getShortest(currentNode, shortestList)
		adjacents := findAdjacents(currentNode, adjacentMatrix)
		for i := 0; i < len(adjacents); i++ {
			adj := adjacents[i]
			s := getShortest(adj.end, shortestList)
			if currentShortest.shortest+adj.weight < s.shortest || (currentShortest.shortest+adj.weight == s.shortest && len(currentShortest.edges)+1 > len(s.edges)) {
				setShortest(adj.end, adj, currentShortest, shortestList)
				nodeStack = append(nodeStack, adj.end)
			}
		}
	}
}

func getShortest(node int, shortestList []ShortestInfo) ShortestInfo {
	return shortestList[node-1]
}

func setShortest(node int, edge Edge, currentShortest ShortestInfo, shortestList []ShortestInfo) {
	newEdges := make([]Edge, len(currentShortest.edges)+1)
	for i := 0; i < len(newEdges)-1; i++ {
		newEdges[i] = currentShortest.edges[i]
	}
	newEdges[len(newEdges)-1] = edge
	shortestInfo := ShortestInfo{edges: newEdges, shortest: currentShortest.shortest + edge.weight}
	shortestList[node-1] = shortestInfo
}

func findAdjacents(currentNode int, adjacentMatrix [][]int) []Edge {
	adjacents := adjacentMatrix[currentNode-1]
	edges := []Edge{}
	for i, v := range adjacents {
		if v > 0 {
			edges = append(edges, Edge{start: currentNode, end: i + 1, weight: v})
		}
	}
	return edges
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

C++: #include<stdio.h>
//#include<cstdlib>
// 0origin

#define MAX 100
#define INF 2001
#define WHITE 0
#define BLACK 1

int n;

// calculate the minimum cost
int PrimMST(int a[MAX][MAX]){ //refered to http://www.deqnotes.net/acmicpc/prim/#a1
    int v,i,j = 0, color[MAX], mincost, sumcost = 0, connected;
    
    for (i = 0; i < n; i++) {
        color[i] = WHITE;
    }
    
    color[0] = BLACK;
    while (j < n-1){
        
        mincost = INF;
        connected = INF;
        for (v = 0; v < n; v++) {
            if(color[v] == WHITE){
                continue;
            }
            for (i = 0; i < n; i++) {
                //printf("color[%d] : %s, cost %d to %d : %d\n", i, color[i] == 1 ? "BLACK" : "WHITE", v, i, a[v][i]);
                if (color[i] == WHITE && mincost > a[v][i]) {
                    mincost = a[v][i];
                    connected = i;
                    //printf("  min is rewritten : %d\n", mincost);
                }
            }
        
        }
        //printf("\nfin:%d\n\n", mincost);
        sumcost += mincost;
        color[v] = BLACK;
        if (connected != INF) {
            color[connected] = BLACK;
        }
        
        j++;
        
    }
    return sumcost;
}

int main(){
    int i, j, a[MAX][MAX];
    
    scanf("%d", &n);
    
    //printf("\n\n\n");
    for(i = 0; i < n; i++){
        for(j = 0; j < n; j++){
            scanf("%d", &a[i][j]);
            if(a[i][j] == -1){
                a[i][j] = INF;
            }
            //printf(" %4d", a[i][j] != INF ? a[i][j] : -1);
        }
        //printf("\n");
    }
    
    printf("%d\n", PrimMST(a));
    
    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[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() {
	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;

	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[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() {
  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;

  return 0;
}

C++: #include <iostream>
using namespace std;
int map[101][101];
int dp[101];
bool decided[101];
int sum,n;
int node,nextnode,mincost;
void check(){
	node=1;
	decided[node]=true;
	dp[node]=0;
	while(1){
		nextnode=-1;
		mincost=20000;
		dp[node]=0;
		for(int i=1;i<=n;i++){
			if(map[node][i]==-1||decided[i])continue;

			if(dp[i]==-1){
				dp[i]=map[node][i]+dp[node];
			}else{
				dp[i]=min(dp[i],map[node][i]+dp[node]);
			}
			if(mincost>dp[i])nextnode=i;
		}
		if(nextnode==-1)break;
		sum+=map[node][nextnode];
		decided[nextnode]=true;
		node=nextnode;
	}
}

int main(){
	cin >>n;
	for(int i=1;i<=n;i++){
		dp[i]=-1;
	}

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

	check();
	cout << sum<<endl;
}