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

void dijkstra(){
    int minv;
    int d[MAX], color[MAX];

    for(int i=0;i<n;i++){
        d[i]=INFTY;
        color[i]=WHITE;
    }

    d[0] = 0;
    color[0] = GRAY;

    while(1){
        minv = INFTY;
        int 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]>d[u]+M[u][v]){
                    d[v] = d[u] + M[u][v];
                    color[v]= GRAY;
                }
            }
        }
    }

    for(int i=0;i<n;i++){
        cout << i << " " << (d[i]==INFTY?-1:d[i]) << endl;
    }
}

int main(){
    cin >> n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++) M[i][j] = INFTY;
    }

    int k, c, u, v;

    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 <algorithm>
#include <string>
#include <queue>
#include <functional>

#define INPUT_FROM_FILE (0) 
#if INPUT_FROM_FILE
#include <fstream>
#endif

typedef std::pair<int, int> P;

class Edge{
public:
	int to;
	int cost;

	Edge(){
		return;
	}
	~Edge(){
		return;
	}
};

int main(int argc, char **argv){
	std::vector<std::vector<Edge> >  G;
	std::vector<long> min_cost;
	std::priority_queue<P, std::vector<P>, std::greater<P> > que;

	int n, u, k, v, c;

#if INPUT_FROM_FILE
	std::ifstream ifs("test.txt");
	//FILE *fp = fopen("test.txt", "r");
#endif

	
#if INPUT_FROM_FILE
	ifs >> n;
#else
	std::cin >> n;
#endif
	G.resize(n);
	min_cost.resize(n, 1000000000) ;

	for(int i = 0; i < n; i++){
#if INPUT_FROM_FILE
		ifs >> u >> k;
#else
		std::cin >> u >> k;
#endif
		for(int j = 0; j < k; j++){
#if INPUT_FROM_FILE
			ifs >> v >> c;
#else
			std::cin >> v >> c;
#endif
			Edge e;
			e.to = v;
			e.cost = c;

			G[u].push_back(e);

		}
	}

	min_cost[0] = 0;
	que.push(P(0, 0));

	while(!que.empty()){
		P p = que.top(); que.pop();
		int v = p.second;

		if(min_cost[v] < p.first){ 
			continue;
		}

		for(int i = 0; i < G[v].size(); i++){
			Edge e = G[v][i];
			if(min_cost[e.to] > min_cost[v] + e.cost){
				min_cost[e.to] = min_cost[v] + e.cost;
				que.push(P(min_cost[e.to], e.to));
			}
		}
	}

	for(int i = 0; i < n; i++){
		std::cout << i << " " << min_cost[i] << std::endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <limits>

using namespace std;
using MatrixGraph = vector<vector<int>>;

const int infinity = numeric_limits<int>::max();
const int no_label = -1;

vector<int> calc_shortest_path(MatrixGraph matrix_graph, int started_label) {
  vector<int> min_costs(matrix_graph.size(), infinity);
  vector<bool> is_visits(matrix_graph.size(), false);

  min_costs[started_label] = 0;

  while(true) {
    int min_cost_adjacency_label = no_label;
    int min_cost_adjacency_weight = infinity;
    for(int i = 0; i < matrix_graph.size(); i++) {
      if(is_visits[i]) {
        continue;
      }

      if(min_costs[i] < min_cost_adjacency_weight) {
        min_cost_adjacency_label = i;
        min_cost_adjacency_weight = min_costs[i];
      }
    }
    if(min_cost_adjacency_label == no_label) {
      break;
    }

    is_visits[min_cost_adjacency_label] = true;

    for(int i = 0; i < matrix_graph.size(); i++) {
      if(matrix_graph[min_cost_adjacency_label][i] == infinity) {
        continue;
      }

      if(min_costs[min_cost_adjacency_label] + matrix_graph[min_cost_adjacency_label][i] < min_costs[i]) {
        min_costs[i] = min_costs[min_cost_adjacency_label] + matrix_graph[min_cost_adjacency_label][i];
      }
    }
  }

  return min_costs;
}

int main() {
  int vertex_num;
  cin >> vertex_num;
  MatrixGraph matrix_graph(vertex_num, vector<int>(vertex_num, infinity));

  for(int i = 0; i < vertex_num; i++) {
    int label, degree;
    cin >> label >> degree;
    for(int j = 0; j < degree; j++) {
      int adjacency_label;
      int adjacency_weight;
      cin >> adjacency_label >> adjacency_weight;
      matrix_graph[label][adjacency_label] = adjacency_weight;
    }
  }

  vector<int> min_consts = calc_shortest_path(matrix_graph, 0);

  for(int i = 0; i < min_consts.size(); i++) {
    cout << i << ' ' << min_consts[i] << endl;
  }
}