Go: package main

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

const (
	white int = iota
	gray
	black
)

type node struct {
	id     int
	parent int
	edge   []int
	weight []int
	color  int
}

type graph struct {
	nodes    []node
	distance []int
}

var infty = 1 << 32
var null = -1

func constructgraph() *graph {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	n := nextInt(sc)

	g := &graph{make([]node, n), make([]int, n)}

	for i := 0; i < n; i++ {
		id := nextInt(sc)
		edges := nextInt(sc)
		n := node{}
		n.id = id
		n.edge = make([]int, edges)
		n.weight = make([]int, edges)
		n.color = white
		for j := 0; j < edges; j++ {
			to := nextInt(sc)
			w := nextInt(sc)
			n.edge[j] = to
			n.weight[j] = w
		}
		g.nodes[id] = n
	}
	return g
}

func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

func (g *graph) preparedijkstra(s int) {
	for i := 0; i < len(g.nodes); i++ {
		g.nodes[i].color = white
		g.nodes[i].parent = null
		g.distance[i] = infty
	}
	g.distance[s] = 0
}

func (g *graph) dijkstra(s int) []int {
	g.preparedijkstra(s)

	for {
		var u int
		mincost := infty
		for i, d := range g.distance {
			if g.nodes[i].color != black && mincost > d {
				mincost = d
				u = i
			}
		}

		if mincost == infty {
			break
		}

		g.nodes[u].color = black

		for i, e := range g.nodes[u].edge {
			if g.nodes[e].color != black {
				if g.distance[e] > g.distance[u]+g.nodes[u].weight[i] {
					g.distance[e] = g.distance[u] + g.nodes[u].weight[i]
					g.nodes[e].parent = u
					g.nodes[e].color = gray
				}
			}
		}
	}
	return g.distance
}

func printShortestPath(d []int) {
	for i, v := range d {
		fmt.Printf("%d %d\n", i, v)
	}
}

func main() {
	g := constructgraph()
	d := g.dijkstra(0)
	printShortestPath(d)
}

C++: #include<bits/stdc++.h>
using namespace std;
static const int INF=1000000;
int n;
int G[100][100];
int d[100];
int color[100];

void dijkstra(){
  int minv;
  for(int i=0;i<n;i++){
    d[i]=INF;
    color[i]=0;
  }
  
  color[0]=1;
  d[0]=0;
  
  while(1){
    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 &&G[u][v] !=INF){
        if(d[v]>d[u]+G[u][v]){
          d[v]=d[u]+G[u][v];
          color[v]=1;
        }
      }
    }
  }
  
  for(int i=0;i<n;i++){
    cout<<i<<" "<<d[i]<<endl;
  }
}

int main(){
  cin>>n;
  int u,k,v,c;
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      G[i][j]=INF;
    }
  }
  
  for(int i=0;i<n;i++){
    cin>>u>>k;
    for(int i=0;i<k;i++){
      cin>>v>>c;
      G[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++)
	{
		//cout << "Z" << i << endl;
		if ( (cost_ps[ret] > cost_ps[i] && cost[i]==-1 || cost[ret] != -1 ) && cost_ps[i]!=-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>
#include<cstdio>
#define INF 1000000
#define NIL -2
#define GRAY -3
#define WHITE -4
#define BRACK -5

using namespace std;

int n;
int M[101][101];
int d[101];//重み
//int p[101];//親
int color[101];
int sum = 0;

void Dijkstra(int u) {
	//cout << u << endl;
	color[u] = BRACK;

	//重みの更新
	for (int i = 0; i < n; i++) {
		if (color[i] != BRACK && M[u][i] != 0) {
			color[i] = GRAY;
			if ((d[u] + M[u][i]) < d[i]) {
				d[i] = d[u] + M[u][i];
			}
		}
	}
	
	int min = -1;
	d[min] = 100000;


	for (int v = 0; v < n; v++) {
		if (color[v] != BRACK) {
			if (d[v] < d[min]) {
				min = v;
			}
			else {
				color[v] = WHITE;
			}
		}
	}

	if (min != -1) {
		Dijkstra(min);
	}
}

int main() {
	cin >> n;
	int v, k, g, weight; //v = 節点番号　g = 次数

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

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

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

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

	d[0] = 0;

	//関数
	Dijkstra(0);

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

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define MAX 100
#define WHITE 0
#define BLACK 1
#define INFTY 100000001

// グラフの頂点数
int n;
// 隣接行列
vector<vector<int> > M(MAX, vector<int>(MAX, -1));
// 頂点の状態を表す配列
vector<int> color(MAX, WHITE);
// d[v]は始点sからS内の点のみを通ってvに行く経路の最小コスト
vector<int> d(MAX, INFTY);

void dijkstra()
{
  // 初期化
  d.at(0) = 0;

  // 初期状態でSの頂点数は0
  while (1)
  {
    // uはV-Sの頂点でd[u]が最小となるもの
    int u;
    int m = INFTY;
    for (int i = 0; i < n; i++)
    {
      // dが未設定の頂点については条件式の右の条件ではじかれる
      if (color.at(i) == WHITE && d.at(i) < m)
      {
        m = d.at(i);
        u = i;
      }
    }

    if (m == INFTY)
    {
      // V=Sとなったとき
      break;
    }

    // uをSに追加する
    color.at(u) = BLACK;

    // uに隣接するV-Sの頂点のdを更新する
    for (int i = 0; i < n; i++)
    {
      if (M.at(u).at(i) != -1 && color.at(i) == WHITE)
      {
        // iはuと隣接しているV-Sの頂点
        d.at(i) = min(d.at(i), d.at(u) + M.at(u).at(i));
      }
    }
  }
}

int main()
{
  cin >> n;
  for (int i = 0; i < n; i++)
  {
    int u, m;
    cin >> u >> m;
    for (int j = 0; j < m; j++)
    {
      int v, c;
      cin >> v >> c;
      M.at(u).at(v) = c;
    }
  }

  dijkstra();

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

C++: #include <iostream>

using namespace std;

#define MAX 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define INFTY 99999999

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

int dijkstra(int s)
{

	int mincost;
	int u;

	for (int i = 0; i < n; i++) {
		d[i] = INFTY;
		p[i] = -1;
	}
	d[s] = 0;

	while (true) {
		mincost = INFTY;

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

		if (mincost == INFTY) {
			break;
		}

		color[u] = BLACK;

		for (int i = 0; i < n; i++) {
			if (color[i] != BLACK&&M[u][i] != INFTY) {
				if (d[u] + M[u][i] < d[i]) {
					d[i] = d[u] + M[u][i];
					p[i] = u;
					color[i] = GRAY;
				}
			}
		}


	}


	int sum = 0;

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

	return sum;


}

int main(void)
{

	cin >> n;

	int u;
	int k;
	int 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;
			cin >> M[u][v];
		}
	}

	dijkstra(0);

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

	return 0;
}