Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

const T = 10000000

var n int
var A [101][101]int

func nextInt() int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return i
}
func Shortestsearch() {
	var Minimum int
	var d, color [100]int
	var u int

	for i := 0; i < n; i++ {
		d[i] = T
		color[i] = 0
	}

	d[0] = 0
	color[0] = 1

	for {
		Minimum = T
		u = -1
		for i := 0; i < n; i++ {
			if Minimum > d[i] && color[i] != 2 {
				u = i
				Minimum = d[i]
			}
		}
		if u == -1 {
			break
		}
		color[u] = 2
		for j := 0; j < n; j++ {
			if color[j] != 2 && A[u][j] != T {
				if d[j] > d[u]+A[u][j] {
					d[j] = d[u] + A[u][j]
					color[j] = 1
				}
			}
		}
	}
	for i := 0; i < n; i++ {
		fmt.Printf("%d %d\n", i, d[i])
	}
}
func main() {
	sc.Split(bufio.ScanWords)
	n = nextInt()

	for i := 0; i < n; i++ {
		for j := 0; j < n; j++ {
			A[i][j] = T
		}
	}
	for i := 0; i < n; i++ {
		u := nextInt()
		k := nextInt()
		for j := 0; j < k; j++ {
			v := nextInt()
			c := nextInt()
			A[u][v] = c
		}
	}
	Shortestsearch()
}

C++: #include <iostream>
using namespace std;
#define MAX 100
#define INFTY 1<<22
#define WHITE 0
#define GRAY 1
#define BLACK 2

int gMatrix[MAX][MAX];

void dijkstra(int n){
    // 最小の重みを記録する
    int minV;
    // weight[v]に始点sからvまでの最短コストを保存する
    int weight[MAX];
    // 訪問状態を記録
    int color[MAX];
    // 1.初期化
    for(int i = 0;i < n;++i){
        weight[i] = INFTY;
        color[i] = WHITE;
    }
    // 始点
    weight[0] = 0;
    color[0] = GRAY;
    
    while(1){
        minV = INFTY;
        // 頂点を示す
        int u = -1;
        // 2.1weight[u]が最小である頂点を決定する
        for(int i = 0;i < n;++i){
            if(minV > weight[i] && color[i] != BLACK){
                u = i;
                minV = weight[i];
            }
        }
        if(u == -1)break;
        color[u] = BLACK;
        
        for(int v = 0;v < n;++v){
            // 辺が存在する
            if(color[v] != BLACK && gMatrix[u][v] != INFTY){
                // 2.2最短コストを更新する
                // この処理の終了後weight[v]sからS内の頂点のみを経由したvまでの最短コストが記録される
                if(weight[v] > weight[u] + gMatrix[u][v]){
                    weight[v] = weight[u] + gMatrix[u][v];
                    color[v] = GRAY;
                }
            }
        }
    }
    // 出力
    for(int i = 0;i < n;++i){
        cout << i << " " << ( weight[i] == INFTY ? -1 : weight[i] ) << endl;
    }
}

int main(){
    int n;
    cin >> n;
    
    for(int i = 0;i < n;++i){
        for(int j = 0;j < n;++j){
            gMatrix[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;
            gMatrix[u][v] = c;
        }
    }
    dijkstra(n);
    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 )
		{
			cout << "B" << cost[ret] << endl;
			ret = i;
			printf("ret=%d\n", ret);
		}
	}
	cout << cost_ps[ret] << endl;

	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_ps[i] << endl;
	}

	return 0;
}

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

const int N=100;
const int INF=2000000000;
const int WHITE=0;
const int GRAY=1;
const int BLACK=2;

int n,M[N][N],d[N],color[N];

void dijkstra(){
    d[0]=0;
    color[0]=GRAY;
    while(true){
        int min_des=INF;
        int vertex=-1;
        for(int i=0;i<n;i++){
            if(min_des>d[i]&&color[i]==GRAY){
                min_des=d[i];
                vertex=i;
            }
        }
        if(vertex==-1) break;
        color[vertex]=BLACK;
        for(int i=0;i<n;i++){
            if(color[i]!=BLACK&&M[vertex][i]<INF){
                if(d[i]>d[vertex]+M[vertex][i]){
                    d[i]=d[vertex]+M[vertex][i];
                    color[i]=GRAY;
                }
            }
        }
    }
}        

int main(){
    int u,k,v,c;
    cin>>n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            M[i][j]=INF;
        }
        d[i]=INF;
        color[i]=WHITE;
    }
    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();

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

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 s)
{
    int u, minv;
    int color[MAX], d[MAX], p[MAX];
    for (int i = 0; i != n; ++i)
    {
        color[i] = WHITE;
        d[i] = INFTY;
        p[i] = -1;
    }
    d[s] = 0;
    while (true)
    {
        minv = INFTY;
        for (int i = 0; i != n; ++i)
        {
            if (color[i] != BLACK && d[i] < minv)
            {
                u = i;
                minv = d[i];
            }
        }
        if (minv == INFTY)
        {
            break;
        }
        color[u] = BLACK;
        for (int v = 0; v != n; ++v)
        {
            if (M[u][v] != INFTY && color[v] != BLACK)
            {
                if (d[u] + M[u][v] < d[v])
                {
                    d[v] = d[u] + M[u][v];
                    color[v] = GRAY;
                    p[v] = u;
                }
            }
        }
    }
    for (int i = 0; i != n; ++i)
    {
        cout << i << " " << d[i] << endl;
    }
}

int main()
{
    int u, k, v, c;
    cin >> n;
    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(0);
    return 0;
}

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

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T*)array, (T*)(array + N), val);
}

const int INF = (1 << 21);

int n;
int m[100][100];

void dijikstra()
{
  int minv;
  int d[100], color[100];

  fill(d, d + 100, INF);
  fill(color, color + 100, 0);

  d[0] = 0;
  color[0] = 1;
  while (true) {
    minv = INF;
    int u = -1;
    for (int i = 0; i < n; i++) {
      if (minv > d[i] && color[i] != 2) {
        u = i;
        minv = d[i];
      }
    }
  
    if (u == -1) break;
    color[u] = 2;
  
    for (int v = 0; v < n; v++) {
      if (color[v] != 2 && m[u][v] != INF) {
        if (d[v] > d[u] + m[u][v]) {
          d[v] = d[u] + m[u][v];
          color[v] = 1;
        }
      }
    }
  }
  
  for (int i = 0; i < n; i++) {
    cout << i << " " << (d[i] == INF ? -1 : d[i]) << endl;
  }
}

signed main()
{
  int k, u, v, c;

  Fill(m, INF);

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

  dijikstra();

  return (0);
}