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<bits/stdc++.h>

using namespace std;

struct edge
{
    int from,to,cost;
    edge(int _from=0,int _to=0,int _cost=0)
    {
        from=_from;to=_to;cost=_cost;
    }
}edg[10010];

int n,m;

int d[110];
const int INF=1e9+7;
bool bellman(int s)
{
    fill(d,d+n,INF);
    d[s]=0;

    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            edge e=edg[j];
            if(d[e.to]>d[e.from]+e.cost)
            {
                d[e.to]=d[e.from]+e.cost;
                if(i==n-1) return false;
            }
        }
    }
    return true;
}

int main()
{

    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    while(cin>>n)
    {
        m=0;
        int a,b,c,dd;
        for(int i=0;i<n;i++)
        {
            cin>>a>>b;
            for(int j=0;j<b;j++)
            {
                cin>>c>>dd;
                edg[m++]=edge(a,c,dd);
            }
        }
        bellman(0);

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



    return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cctype>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
#define MAX_N 100000000
#define MAX 
using namespace std;
bool debug=false;

int cost[105][105];
int d[105];
bool used[105];
int n;

void Input(){
  cin>>n;
  rep(i,0,n)rep(j,0,n)cost[i][j]=INF;
  for(int i=0;i<n;i++){
  	int from,to,num,c;
  	cin>>from>>num;
  	for(int j=0;j<num;j++){
  		cin>>to>>c;
  		cost[from][to]=c;
  	}
  }
  rep(i,0,105){
    used[i]=false;
    d[i]=INF;
  }
}

void solve(){
  d[0]=0;
  while(1){
    int vertex=-1;

    for(int i=0;i<n;i++){
      if(!used[i]&&(vertex==-1||d[i]<d[vertex])){
	    vertex=i;
      }
    }
    if(vertex==-1)break;
    used[vertex]=true;
    for(int i=0;i<n;i++){
      d[i]=min(d[i],d[vertex]+cost[vertex][i]);
    }
  }
}

int main(){
  Input();
  cout<<"a"<<endl;
  solve();
  for(int i=0;i<n;i++)cout<<i<<" "<<d[i]<<endl;
  return 0;
}

C++: #include <iostream>
#include <iomanip>


using namespace std;

const int  MAXN = 150;
const int IFNTY = 1 << 20;
const int NIL = -1;


void dijkstra(int adj_matrix[][MAXN], int n, int u, int dis[]);


int main()
{
	int adj_matrix[MAXN][MAXN];
	
	
	
	for (int i = 0; i < MAXN; i++)
	{
		for (int j = 0; j < MAXN; j++)
		{
			adj_matrix[i][j] = IFNTY;			
		}
	}

	int n;
	cin >> n;
	
	for (int i = 1; i <= n; i++)
	{
		int ID1, degree;
		cin >> ID1 >> degree;
		for (int j = 1; j <= degree; j++)
		{
			int ID2, weight;	
			cin >> ID2 >> weight;
			adj_matrix[ID1][ID2] = weight;		
		}
	}	
	
//	for (int i = 0; i < n; i++)
//	{
//		for (int j = 0; j < n; j++)
//		{
//			if (adj_matrix[i][j] == IFNTY)
//				cout << setw(3) << "-" << " ";
//			else
//				cout << setw(3) << adj_matrix[i][j] << " ";			
//		}
//		cout << endl;
//	}

	int dis[MAXN];	
	
	dijkstra(adj_matrix, n, 0, dis);
	
	for (int i = 0; i < n; i++)
	{
		cout << i << ' ' << dis[i] << endl;
	}
}



void dijkstra(int adj_matrix[][MAXN], int n, int u, int dis[])
{
	bool visited[MAXN] = {0};
	
	for (int v = 0; v < n; v++)
	{
		dis[v] = adj_matrix[u][v];
	}
	
	dis[u] = 0;
	visited[u] = true;
	
	while (true)
	{
		int w = NIL;
		int min = IFNTY;
		for (int v = 0; v < n; v++)
		{
			if (min > dis[v] && !visited[v])
			{
				w = v;
				min = dis[v];
			}
		}
		
		
		if (w == NIL) break;
		
		visited[w] = true;
		for (int v = 0; v < n; v++)
		{
			if (dis[v] > dis[w] + adj_matrix[w][v])
			{
				dis[v] = dis[w] + adj_matrix[w][v];
			}
		}
	}
}

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