Go: package main

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

const (
	MAX_N      = 100
	MAX_WEIGHT = 100000
)

type Edge struct {
	start  int
	end    int
	weight int
}

type ShortestInfo struct {
	edges    []Edge
	shortest int
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	shortestList := make([]ShortestInfo, n)
	for i := 1; i < n; i++ {
		shortestList[i] = ShortestInfo{edges: []Edge{}, shortest: MAX_N*MAX_WEIGHT + 1}
	}

	adjacentMatrix, err := createAdjacentMatrix(n, sc)
	if err != nil {
		panic(err)
	}

	sssp([]int{1}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Printf("%d %d\n", v.getEnd()-1, v.shortest)
	}
}

func (si ShortestInfo) getEnd() int {
	if len(si.edges) == 0 {
		return 1
	} else {
		return si.edges[len(si.edges)-1].end
	}
}

func createAdjacentMatrix(n int, sc *bufio.Scanner) ([][]int, error) {
	adjacentMatrix := make([][]int, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		adjacentMatrix[id] = make([]int, n)
		for j := 0; j < n; j++ {
			adjacentMatrix[id][j] = -1
		}
		vertexNum, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		for j := 0; j < vertexNum; j++ {
			v, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			c, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			adjacentMatrix[id][v] = c
		}
	}
	return adjacentMatrix, nil
}

func sssp(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]int) {
	for len(nodeStack) > 0 {
		currentNode := nodeStack[0]
		nodeStack = nodeStack[1:]
		currentShortest := getShortest(currentNode, shortestList)
		adjacents := findAdjacents(currentNode, adjacentMatrix)
		for i := 0; i < len(adjacents); i++ {
			adj := adjacents[i]
			if currentShortest.shortest+adj.weight < getShortest(adj.end, shortestList).shortest {
				setShortest(adj.end, adj, currentShortest, shortestList)
				nodeStack = append(nodeStack, adj.end)
			}
		}
	}
}

func getShortest(node int, shortestList []ShortestInfo) ShortestInfo {
	return shortestList[node-1]
}

func setShortest(node int, edge Edge, currentShortest ShortestInfo, shortestList []ShortestInfo) {
	newEdges := make([]Edge, len(currentShortest.edges)+1)
	for i := 0; i < len(newEdges)-1; i++ {
		newEdges[i] = currentShortest.edges[i]
	}
	newEdges[len(newEdges)-1] = edge
	shortestInfo := ShortestInfo{edges: newEdges, shortest: currentShortest.shortest + edge.weight}
	shortestList[node-1] = shortestInfo
}

func findAdjacents(currentNode int, adjacentMatrix [][]int) []Edge {
	adjacents := adjacentMatrix[currentNode-1]
	edges := []Edge{}
	for i, v := range adjacents {
		if v > 0 {
			edges = append(edges, Edge{start: currentNode, end: i + 1, weight: v})
		}
	}
	return edges
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

C++: #include<iostream>
#include<queue>
#define INF 100000000
using namespace std;
int main(){
  int n;cin>>n;
  int u,k,v,c;
  int mp[101][101],d[101];
  for(int i=0;i<=100;i++){
    d[i]=INF;
    for(int j=0;j<=100;j++)mp[i][j]=INF;
  }
    while(u!=n-1){
    cin>>u>>k;
    for(int i=0;i<k;i++){
      cin>>v>>c;
      if(mp[u][v]>c)mp[u][v]=c;
    }
  }
    d[0]=0;
    queue<int>p;
    p.push(0);
    int mn,s=0,cnt=n;
    while(cnt&&!p.empty()){
      s=p.back();
      mn=INF;
      for(int i=0;i<n;i++){
	if(d[i]>=d[s]+mp[s][i]){
	  d[i]=d[s]+mp[s][i];
	  if(mn>d[i])mn=d[i],k=i;
	}
      }
      if(mn!=INF)cnt--,p.push(k);
      else p.pop();
    }
    for(int i=0;i<n;i++)cout<<i<<" "<<d[i]<<endl;
    
  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#define Lens 101
#define Inf 1<<22

using namespace std;
int N;
int w[Lens][Lens],p[Lens],d[Lens];
char c[Lens];

void dijkstra()
{
	d[0] = 0;
	while (true)
	{
		int u = -1;
		int minv = Inf;
		for (int i = 0; i < N; i++)
		{
			if (c[i] == 'w'&&minv > d[i])
			{
				minv = d[i];
				u = i;
			}
		}
		if (u == -1) break;
		c[u] = 'b';
		for (int v = 0; v < N; v++)
		{
			if (c[v] == 'w'&&w[u][v] != Inf)
				d[v] = min(d[v], w[u][v]+d[u]);
		}
	}
}

int main()
{
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		c[i] = 'w';
		d[i] = Inf;
		p[i] = -1;
		int u,n;
		cin >> u >> n;
		for (int j = 0; j < n; j++)
		{
			int v, tw;
			cin >> v >> tw;
			w[u][v] = tw;
		}
	}
	for(int i=0;i<N;i++)
		for (int j = 0; j < N; j++)
		{
			if (w[i][j] == 0)
				w[i][j] = Inf;
		}
	dijkstra();
	for (int i = 0; i < N; i++)
		cout << i <<' '<< d[i] << endl;
	return 0;
}

C++: //
//  ALDS_12_B.cpp
//  
//
//  Created by 杵鞭俊 on 2018/07/24.
//

#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++: #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
#include <cstring>
#define maxn 101
#define INF 0x3f3f3f3f
using namespace std;

int m[maxn][maxn] = {}, d[maxn] = {}, color[maxn] = {};
int n;

void Dijkstra()
{
	for (int i = 1; i < n; i++)
		d[i] = INF;
	d[0] = 0;
	while (true)
	{
		int mincost = INF,u;
		for(int i=0;i<n;i++)
			if (d[i] < mincost&&color[i]==0)
			{
				mincost = d[i];
				u = i;
			}
		if (mincost == INF)break;
		color[u] = 1;
		for (int i = 0; i < n; i++)
			if (color[i] == 0 && m[u][i] != -1)
				if (d[i] > d[u] + m[u][i])
					d[i] = d[u] + m[u][i];
	}
}
int main()
{
	scanf("%d", &n);
	memset(m, -1, sizeof(m));
	for (int i = 0; i < n; i++)
	{
		int u, k;
		scanf("%d %d", &u, &k);
		for (int i = 0; i < k;i++)
		{
			int v, c;
			scanf("%d%d", &v, &c);
			m[u][v] = c;
		}
	}
	Dijkstra();
	for (int i = 0; i < n; i++)
	{
		printf("%d %d\n", i, d[i]);
	}
	return 0;
}