Go: package main

import (
	"bufio"
	"container/heap"
	"fmt"
	"os"
	"strconv"
)

type Node struct {
	id     int
	weight int
}

func init() {
	sc.Split(bufio.ScanWords)
}

type NodeHeap []Node

func (h NodeHeap) Len() int           { return len(h) }
func (h NodeHeap) Less(i, j int) bool { return h[i].weight < h[j].weight }
func (h NodeHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *NodeHeap) Push(x interface{}) {
	*h = append(*h, x.(Node))
}

func (h *NodeHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}

var sc = bufio.NewScanner(os.Stdin)

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func main() {
	n := scanInt()

	list := make([][]int, n)
	seen := make([]bool, n)
	for i := range list {
		list[i] = make([]int, n)
		for j := range list[i] {
			list[i][j] = scanInt()
		}
	}

	start := Node{id: 0, weight: 0}
	h := &NodeHeap{start}
	heap.Init(h)

	sum := 0
	for h.Len() > 0 {
		node := heap.Pop(h).(Node)
		if seen[node.id] {
			continue
		}
		seen[node.id] = true
		sum += node.weight

		for i, w := range list[node.id] {
			if w < 0 {
				continue
			}
			heap.Push(h, Node{id: i, weight: w})
		}
	}

	fmt.Println(sum)
}

C++: #include <bits/stdc++.h>
using namespace std;
#define INFTY (1<<30)

int n;
vector<int> color(101,0),d(101,INFTY),p(101);
vector<vector<int>> M(101,vector<int>(101,INFTY));

void prim(){
    d[0]=0;
    p[0]=-1;

    while(1){
        int u;
        int mincost=INFTY;
        for(int i=0;i<n;i++){
            if(color[i]!=2&&d[i]<mincost){
                mincost=d[i];
                u=i;
            }
        }
        if(mincost==INFTY) break;
        color[u]=2;

        for(int v=0;v<n;v++){
            if(color[v]!=2&&M[u][v]<INFTY){
                if(M[u][v]<d[v]){
                    d[v]=M[u][v];
                    p[v]=u;
                    color[v]=1;
                }
            }
        }

    }

}

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

    prim();

    int ans=0;
    for(int i=0;i<n;i++){
        ans+=d[i];
    }
    cout<<ans<<endl;
}

C++: #include <iostream>
#include <queue>
using namespace std;
int main() {
    int n;
    cin >> n;
    int a[100][100];
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            cin >> a[i][j];
    struct Edge {
        int from, to, weight;
        Edge(int from, int to, int weight) : from(from), to(to), weight(weight) {}
        bool operator < (const Edge& e) const {
            return weight > e.weight;
        }
    };
    int sm = 0;
    priority_queue<Edge> q;
    q.push(Edge(-1, 0, 0));
    bool visited[100]{};
    while (q.size()) {
        auto e = q.top();
        q.pop();
        if (visited[e.to]) continue;
        visited[e.to] = true;
        sm += e.weight;
        for (int i = 0; i < n; ++i) {
            if (a[e.to][i] >= 0 && !visited[i])
                q.push(Edge(e.to, i, a[e.to][i]));
        }
    }
    cout << sm << endl;
    return 0;
}

C++: #include<stdio.h>
#include<limits.h>
#define NIL -1
static const int MAX = 500;
static const int INFTY = (1<<21);
int n, i, j, e, v, sum, u , minV;
main(){
 
  int M[MAX][MAX], key[MAX], L[MAX],A[MAX];
  
  scanf("%d", &n);
  
  for ( i = 0; i< n; i++ ){
    for ( j = 0; j < n; j++ ){
      scanf("%d", &e);
      M[i][j] = (e==-1)?INFTY:e;
    }
  }

  for(i = 0; i < n; i++){
    key[i] = INT_MAX;
    L[i] = NIL;
    A[i] = NIL;
  }
  
  key[0]=0;
  
  for(;;){
    
    u = NIL;
    
    minV = INT_MAX;
    
    for(i = 0;  i < n; i++){
      
      if(key[i] < minV && A[i] == NIL){
        
        u = i;
        
        minV = key[i];
        
      }
      
    }  
    if(u == NIL)break;
    
    A[u] = u; 
    
    for(v = 0; v < n; v++){
      if(M[u][v] < key[v] && A[v] == NIL){
        key[v] = M[u][v];
        L[v] = u;
      }
    }
  }
  
  sum = 0;
  
  for ( i = 0; i < n; i++ ){
    if ( L[i] != -1 ) sum +=M[L[i]][i];
  }
  
  printf("%d\n", sum);
  
  
  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;
}

C++: //
// Created by 李青坪 on 2018/11/6.
//

#include <cstdio>
#include <algorithm>
#include <set>
#define MAXN 100
#define INFINITY 1<<20
#define NIL -1
using namespace std;

int n;
int sum;
int graph[MAXN][MAXN];
int d[MAXN];
int parent[MAXN];
set<int> T;
set<int> V_T;

void init(){
    fill(d, d+n, INFINITY);
    fill(parent, parent+n, NIL);
    T.insert(0);
    for (int i = 1; i < n; ++i) {
        V_T.insert(i);
    }
    for (int j = 0; j < n; ++j) {
        d[j] = graph[0][j];
    }
}

void updateMinWeight(){

}

pair<int, pair<int, int> > findMinEdge(){
    int min = INFINITY;
    pair<int, int> r;
    set<int >::iterator itr;
    for (itr = T.begin(); itr != T.end(); itr++){
        for (set<int>::iterator itr1 = V_T.begin(); itr1 != V_T.end(); itr1++){
            if (graph[*itr][*itr1] < min){
                min = graph[*itr][*itr1];
                r = make_pair(*itr, *itr1);
            }
        }
    }
    return make_pair(min, r);
}

void findMinSpanTree(){
    while (!V_T.empty()){
        pair<int, pair<int, int> > v = findMinEdge();
        sum += v.first;
        parent[v.second.second] = v.second.first;
        T.insert(v.second.second);
        V_T.erase(V_T.find(v.second.second));
    }
}

int main(){
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        int w;
        for (int j = 0; j < n; ++j) {
            scanf("%d", &w);
            if (w == -1) graph[i][j] = INFINITY;
            else graph[i][j] = w;
        }
    }
    init();
    findMinSpanTree();
    printf("%d\n", sum);
}
/*
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
 */

C++: #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF (1<<21)
#define white 0
#define gray 1
#define black 2

int n;
int W[100][100];
int color[100],d[100],p[100];

int prim() {

  d[0] = 0;

  while(true) {
    int mini = INF,u;
    for(int i = 0;i < n;i++) {
      if(d[i] < mini && color[i] != black) {
        mini = d[i];
        u = i;
      }
    }

    

    if(mini == INF) break;
    color[u] = black;

    for(int i = 0;i < n;i++) {
      if(color[i] != black && W[u][i] != -1) {
        if(W[u][i] < d[i]) {
          d[i] = W[u][i];
          p[i] = u;
        }
      }
    }
  }

  int sum = 0;
  for(int i = 0;i < n;i++) {
    if(p[i] != -1) sum += W[i][p[i]];
  }
 
  return sum;

}


int main() {

  cin >> n;

  for(int i = 0;i < n;i++) {
    color[i] = white;
    d[i] = INF;
    p[i] = -1;
    for(int j = 0;j < n;j++) {
      int a;
      cin >> a;
      W[i][j] = a;
    }
  }

 
    cout << prim() << endl;

}