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<iostream>
#include<vector>
#include<algorithm>
#define MAX_V 100
#define INF 1e9
using namespace std;
int cost[MAX_V][MAX_V];
int d[MAX_V];
bool used[MAX_V];
int V;
void dijkstra(int s) {
	for (int i = 0; i < V; i++) {
		d[i] = INF;
		used[i] = false;
	}
	d[s] = 0;
	while (true) {
		int v = -1;
		for (int u = 0; u < V; u++) {
			if (!used[u] && ((v == -1) || d[u] < d[v])) {
				v = u;
			}
		}
		//全ての頂点が到達済み
		if (v == -1) {
			break;
		}
		//集合に新たに頂点を追加
		used[v] = true;
		for (int u = 0; u < V; u++) {
			d[u] = min(d[u], d[v] + cost[v][u]);
		}
	}
}

int main() {
	for (int i = 0; i < V+100; i++) {
		for (int j = 0; j < V+100; j++) {
			cost[i][j] = INF;//iからjへの辺の重さ
		}
	}
	cin >> V;
	for (int i = 0; i < V; i++) {
		int u;
		cin >> u;
		int k;
		cin >> k;
		for (int j = 0; j < k; j++) {
			int v;
			cin >> v;
			int c;
			cin >> c;
			cost[u][v] = c;
		}
	}
	dijkstra(0);

	for (int i = 0; i < V; i++) {
		cout << i << " " << d[i] << endl;
	}
	return 0;
}

C++: #include <iostream>
#define INF 2000000
#define MAX 100
#define WHITE 0
#define BLACK 1

using namespace std;

int n, d[MAX], color[MAX], w[MAX][MAX];

void dijkstra(int s){
    int u;
    for(u = 0; u < n; u++){
        d[u] = INF;
        color[u] = WHITE;
    }
    d[s] = 0;

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

        for(int v = 0; v < n; v++){
            if(color[v] != BLACK && d[u] + w[u][v] < d[v]){
                d[v] = d[u] + w[u][v];
            }
        }
    }
}

int main(){
    int i, j;
    cin >> n;
    for(i = 0; i < n; i++){
        for(j = 0; j < n; j++){
            w[i][j] = INF;
        }
    }

    int u, k, v, c;
    for(i = 0; i < n; i++){
        cin >> u >> k;
        for(j = 0; j < k; j++){
            cin >> v >> c;
            w[u][v] = c;
        }
    }

    dijkstra(0);

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

    return 0;
}

C++: #include<iostream>
#include<algorithm>
#define MAX 120
#define WHITE -1
#define GRAY 0
#define BLACK 1
#define INFTY (1 << 21)

using namespace std;

int n;
int M[MAX][MAX];
int color[MAX], d[MAX], p[MAX];

void dijkstra(){
    
    int mini;
    
    for(int i=0; i<n; i++){
        color[i] = WHITE;
        d[i] = INFTY;
    }
    
    d[0] = 0;
    color[0] = GRAY;
    
    while(1){
        mini = INFTY;
        int u = -1;
        
        for(int i=0; i<n; i++){
            if(mini > d[i] && color[i] != BLACK){
                u=i;
                mini = 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] > d[u] + M[u][v]){
                    d[v] = d[u] + M[u][v];
                    color[v] = GRAY;
                }
            }
        }
    }
    
    
    for(int i=0; i<n; i++){
        if(d[i] != INFTY){
            cout << i << " " << d[i] << endl;
        }
        
        //cout << i << " " << d[i] << endl;
    }
    
}


int main(){
    cin >> n;
    
    int k, c, u, v;
    
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            M[i][j] = INFTY;
        }
    }
    
    for(int i=0; i<n; i++){
        cin >> u >> k;
        
        for(int j=0; j<k; j++){
            cin >> v >> c;
            
            M[u][v]=c;
        }
    }
    
    dijkstra();
    
    return 0;
}

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

#define go first
#define ct second

int cost[100 + 10] , cost_ps[100 + 10];
int n,vf,k,v,c;

int v_k[100];

vector< pair<int, int> > went[100];

pair<int, int> p_tmp;

int  check_go(int st)
{
	int i;
	int ret=0;

	for (i = 0; i < v_k[st]; i++)
	{
		if (cost_ps[went[st][i].go] > cost[st] + went[st][i].ct || cost_ps[went[st][i].go] == -1)
		{
			cost_ps[went[st][i].go] = cost[st] + went[st][i].ct;
		}
	}

	for (i = 1; i < n; i++)
	{
		if (cost_ps[ret] > cost_ps[i] && cost[i]==-1 && cost_ps[i]!=-1 || cost[ret] != -1 )
		{
			ret = i;
			//printf("ret=%d\n", ret);
		}
	}

	cost[ret] = cost_ps[ret];
	//cout << "A" << cost[ret] << endl;

	return ret;

}

int main()
{
	int i,j;
	int st_num=0;

	cin >> n;

	for (i = 0; i < n; i++)
	{
		cost[i] = cost_ps[i] = -1;

		cin >> vf ;
		cin >> v_k[vf];
		for (j = 0; j < v_k[vf] ; j++)
		{
			cin >> p_tmp.go >> p_tmp.ct;

			went[vf].push_back(p_tmp);
		}
	}

	cost[0] = cost_ps[0] = 0;

	for (i = 1; i < n; i++)
	{
		st_num = check_go(st_num);
	}

	for (i = 0; i < n; i++)
	{
		cout << i << " " << cost[i] << endl;
	}

	return 0;
}