Go: // ダイクストラのアルゴリズム
package main

import (
	"bufio"
	"fmt"
	"log"
	"math"
	"os"
	"strconv"
	"strings"
)

type color int

const (
	white color = iota // 未訪問
	mst                // MSTとして確定
)

// 頂点
type node struct {
	num       int         // 頂点の番号
	weights   map[int]int // 重みMAP
	parent    *node       // MSTへの重み最小の親
	distFromS int         // 始点からの距離
	color     color
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	n := eGetInt(scanner)

	nodes := make([]*node, n)
	for i := 0; i < n; i++ {
		weights := eAtoi((strings.Fields(eGetline(scanner))))
		v := &node{weights[0], make(map[int]int, weights[1]), nil, math.MaxInt32, white}
		for j := 0; j < weights[1]; j++ {
			k := weights[j*2+2] // 相手の頂点名
			w := weights[j*2+3] // 重み
			v.weights[k] = w
		}
		nodes[i] = v
	}

	// 初回はnode[0]がMSTに入るように
	nodes[0].distFromS = 0

	for { // 全部チェックするまで

		// どの頂点を新たにMSTに取り込むか

		var minNode *node
		min := math.MaxInt32
		for _, v := range nodes {
			if v.color == mst {
				continue
			}
			if v.distFromS < min {
				min = v.distFromS
				minNode = v
			}
		}
		if minNode == nil {
			// すべて完了している.
			break
		}

		// MSTに追加する頂点決定
		minNode.color = mst

		// fmt.Printf(">[%v]\n", minNode)
		// MSTに属していない頂点それぞれについて,Startからの最小の重みの距離を更新
		for i, v := range nodes {
			if v.color == mst {
				continue
			}
			w, ok := minNode.weights[i]
			if !ok {
				// minNodeと接してない
				continue
			}

			if minNode.distFromS+w < v.distFromS {
				// minNode経由の距離がもっとも重みが少ないので親を変更
				v.distFromS = minNode.distFromS + w
				v.parent = minNode
				// fmt.Printf("[%v %v]\n", v, minNode)
			}
		}
		// fmt.Printf("<\n")
	}

	for i, v := range nodes {
		fmt.Printf("%d %d\n", i, v.distFromS)
	}
}

func eGetInt(scanner *bufio.Scanner) int {
	t := eAtoi(strings.Fields(eGetline(scanner)))
	return t[0]
}

func eGetline(p *bufio.Scanner) string {
	if !p.Scan() {
		if err := p.Err(); err != nil {
			log.Fatal(err.Error())
		}
		return ""
	}
	return p.Text()
}

func eAtoi(s []string) []int {
	ints := make([]int, len(s))
	var err error
	for i, e := range s {
		ints[i], err = strconv.Atoi(e)
		if err != nil {
			log.Fatal(err.Error())
		}
	}
	return ints
}

C++: #include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n;
vector<pair<int, int>> adj[100];
int *d;

void dijkstra() {
    priority_queue<pair<int, int>> PQ;
    int d[n], color[n];

    for (int i = 0; i < n; i++) {
        d[i] = INFTY;
        color[n] = WHITE;
    }
    d[0] = 0;
    PQ.push(make_pair(0, 0));

    while (!PQ.empty()) {
        pair<int, int> f = PQ.top();
        PQ.pop();

        int u = f.second;
        color[u] = BLACK;

        if (d[u] < f.first * (-1)) { continue; }

        for (int j = 0; j < adj[u].size(); j++) {
            int v = adj[u][j].first;
            if (color[v] == BLACK) { continue; }
            if (d[u] + adj[u][j].second < d[v]) {
                d[v] = d[u] + adj[u][j].second;
                // printf("d[%d] = %d\n", v, d[v]);
                PQ.push(make_pair(d[v] * (-1), v));
                color[v] = GRAY;
            }
        }
    }
    
    for (int i = 0; i < n; i++) {
        printf("%d %d\n", i, d[i]);
    }
}

int main() {
    scanf("%d", &n);

    // adj = new vector<pair<int, int>>[n];

    for (int i = 0; i < n; i++) {
        int u, k;
        scanf("%d %d", &u, &k);
        for (int j = 0; j < k; j++) {
            int v, c;
            scanf("%d %d", &v, &c);
            adj[u].push_back(make_pair(v, c));
        }
    }

    dijkstra();

    return 0;
}

C++: #include<iostream>
#include<sstream>
#include<vector>
#include<climits>

using namespace std;

struct E
{
	int from, to;
	long cost;
};

int main(){
	ostringstream out;

	int n, u, k;
	cin >> n;

	vector<long> d(n);
	vector<E> e;

	fill(d.begin(),d.end(),LONG_MAX);
	d[0]=0;

	for(int i=0;i<n;i++){
		cin >> u >> k;
		for(int j=0;j<k;j++){
			E es={u,0,0};
			cin >> es.to >> es.cost; 
			e.push_back(es);
		}
	}

	while(true){
		bool update=false;
		for(int i=0;i<e.size();i++){
			if(d[e[i].from]!=LONG_MAX&&d[e[i].to]>d[e[i].from]+e[i].cost){
				d[e[i].to]=d[e[i].from]+e[i].cost;
				update=true;
			}
		}
		if(!update)break;
	}

	for(int i=0;i<n;i++)
		out << i << " " << d[i] << endl;

	cout << out.str();
	return 0;
}

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

const int WHITE = 0;
const int GRAY = 1;
const int BLACK = 2;

int n;
vector<vector<int>> G;
vector<int> d;
vector<int> p;
vector<int> colors;

void sssp(int s){
    d[s] = 0;
    while(true){
        int cur_min = INT_MAX;
        int min_id = -1;
        for(int i =0;i<n;i++){
            if(colors[i]!=BLACK && d[i] < cur_min){
                min_id = i;
                //printf("%d %d\n",cur_min,d[i]);
                cur_min = d[i];
            }
        }
        if(min_id==-1) break;
        int u = min_id;
        colors[u] = BLACK;
        for(int v = 0;v<n;v++){
            if(colors[v] !=BLACK && G[u][v]!=INT_MAX){
                if(d[u]+G[u][v] < d[v]){
                    d[v] = d[u]+G[u][v];
                    p[v] = u;
                }
            }
        }
    }
    for(int i =0;i<n;i++) printf("%d %d\n",i,d[i]);
}

int main()
{
    //freopen("data.txt","r",stdin);
    cin >> n;
    G.resize(n,vector<int>(n,INT_MAX));
    d.resize(n,INT_MAX);
    p.resize(n,-1);
    colors.resize(n,WHITE);
    for(int i =0;i<n;i++){
        int u,k;
        cin >>u>>k;
        for(int j=0;j<k;j++){
            int v,c;
            cin >> v >>c;
            G[u][v] = c;
        }
    }
    sssp(0);
    //printf("YES\n");
    return 0;
}

C++: #include<iostream>
using namespace std;
#define MAX 108
#define black 2
#define gray 1
#define white 0
#define INFTY 1<<21
int mark[MAX][MAX];
int color[MAX];
int d[MAX];
int p[MAX];
int n;
inline void display(){
	cout<<endl;
	for(int i = 0;i<n;++i){
		for(int j = 0;j<n;++j)
			cout<<mark[i][j]<<' ';
	cout<<endl;
	}
	cout<<endl;
} 
void dijkstra( int begin ){
	for(int i = 0;i<n;++i){
		d[i] = INFTY;
		p[i] = -1;
		color[i] = white;
	}
	int mincost,u;
	d[0] = 0;
	
	while( true ){
		mincost = INFTY;
		for(int i= 0;i<n;++i)
			if(black!=color[i]&&d[i]<mincost){
				u = i;
				mincost = d[i];
			}
		if(INFTY==mincost)break;
		color[u] = black;
		for(int i =0;i<n;++i)
			if(black!=color[i]&&mark[u][i]!=-1&&d[i]>mincost+mark[u][i]){
				d[i] = mincost+mark[u][i];
				p[i] = u;
				color[i] = gray;
			}
	}
	for(int i = 0;i<n;++i)
		cout<<i<<' '<<d[i]<<endl;
} 

int main(){
	int u,k,vx,c;
	cin>>n;
	for(int i = 0;i<n;++i)
		for(int j=0;j<n;++j)
			mark[i][j] = -1;
	for(int i =0;i<n;++i){
		cin>>u>>k;
		for(int j = 0;j<k;++j){
			cin>>vx>>c;
			mark[u][vx] = c;
		}
	}
	
//	display();
	dijkstra(0);
	return 0;
}
/*
5
0 3 2 3 3 1 1 2
1 2 0 2 3 4
2 3 0 3 3 1 4 1
3 4 2 1 0 1 1 4 4 3
4 2 2 1 3 3


*/

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