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(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++: n = int(raw_input())
A = [0]
i = 0
long = 0
NY = range(1, n)
a = [[0 for i in xrange(n)] for j in xrange(n)]
while i <=n:
    a[i] = map(int,raw_input().split())
    i = i+1
while NY != []:
    amin = 2001
    for i in A:
        for j in NY:
            if 0 <= a[i][j] < amin:
                amin = a[i][j]
                addA = j
    A.append(addA)
    NY.remove(addA)
    long =long + amin
print long

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

int n;
vector< vector<int> > a;

int Prim() {
  vector<int> color(n);
  vector<int> d(n, 1000000000);
  vector<int> p(n);
  d[0] = 0, p[0] = -1;

  while (true) {
    int min_cost = 1000000000, u;
    for (int i = 0; i < n; i++) if (color[i] != 2 && d[i] < min_cost) min_cost = d[i], u = i;
    if (min_cost == 1000000000) break;
    color[u] = 2;
    for (int v = 0; v < n; v++)
      if (color[v] != 2 && a[u][v] != -1)
        if (a[u][v] < d[v]) d[v] = a[u][v], p[v] = u, color[v] = 1;
  }

  int ans = 0;
  for (int i = 0; i < n; i++) if(p[i]!=-1 )ans += a[i][p[i]];

  return ans;
}

int main() {
  cin >> n;
  a.resize(n, vector<int>(n));
  for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> a[i][j];
  cout << Prim() << endl;
}

C++: #include <iostream>
using namespace std;
const int maxx=110;
const int infinity=(1<<30);

int A[maxx][maxx];
bool flag[maxx];	//用flag来标记这个节点是不是在MST中，true是在T里，false是在V-T里；

int main (){
		int n;
		cin>>n;
		for(int i =1;i<=n;i++){
			for(int j=1;j<=n;j++){
				int e;cin>>e;
				A[i][j]=(e==-1)?infinity:e;
			}
		}

		for(int i=0;i<maxx;i++) flag[i]=false;
		int sum=0,minv,minj;
		flag[1]=true;
		while(1){
			minv=infinity;
			minj=-1;
			for(int i=1;i<=n;i++){
				if(flag[i]==true){
					for(int j=1;j<=n;j++){
						if(A[i][j]!=-1 && A[i][j]<minv && flag[j]==false) {
							minv=A[i][j];
							minj=j;
						} 
					}
				}
			}
//			cout<<minj<<endl;
			if(minv==infinity || minj==-1) break;
			flag[minj]=true;
			sum+=minv;
		}
		
		cout<<sum<<endl;
		return 0;
		
}

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

const int INFY = numeric_limits<int>().max();
int n;
typedef vector<vector<int>> GM;

int prim(GM &G) {
    vector<bool> inmst(n, false);
    vector<int> d(n, INFY);
    vector<int> p(n, -1);

    d[0] = 0;
    while(true) {
        int u = -1, minv = INFY;
        for (int i = 0; i < n; ++i) {
            if(!inmst[i] && d[i] < minv) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1) break;
        inmst[u] = true;
        for (int i = 0; i < n; ++i) {
            if (!inmst[i] && G[u][i] != INFY) {
                if (G[u][i] < d[i]) {
                    d[i] = G[u][i];
                    p[i] = u;
                }
            }
        }
    }
    int sum = 0;
    for (int i = 0; i < n; ++i) {
        if(p[i] != -1) sum += G[i][p[i]];
    }
    return sum;
}

int main() {
    cin >> n;
    GM G(n, vector<int>(n));
    for(int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            int c;
            cin >> c;
            G[i][j] = c == -1 ? INFY : c;
        }
    }
    cout << prim(G) << endl;
}

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;
	p[i] = -1;
    }
    d[0] = 0;
    while (1) {
	minv = INFTY;
	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;
}