Go: package main

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

const (
	MAX_N      = 10000
	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 <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <math.h>
#include <ctype.h>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;

typedef long long ll;
typedef pair<ll, int> pp;
#define mp(a, b) make_pair(a, b)

struct edge {
	int v, w;
	int next;
	edge() {}
	edge(int v_, int w_, int n_) : v(v_), w(w_), next(n_) {}
};

int n, cnt;
int head[10001];
edge e[600000];
bool vis[10001];
ll dis[10001];

void init()
{
	cnt = 0;
	memset(head, -1, sizeof head);
}
void addedge(int u, int v, int w)
{
	e[++cnt] = edge(v, w, head[u]); head[u] = cnt;
}
void dijkstra(int s)
{
	for (int i = 0; i < n; i++)
		vis[i] = 0, dis[i] = ll(1e18);
	dis[s] = 0; vis[s] = 1;
	for (int i = head[s]; i != -1; i = e[i].next)
		dis[e[i].v] = e[i].w;
	while(1)
	{
		int idx = -1;
		ll dist = 1e18;
		for (int j = 0; j < n; j++)
			if (!vis[j] && dist > dis[j])
			{
				idx = j;
				dist = dis[j];
			}
		if (idx == -1)
			break;
		vis[idx] = 1;
		for (int j = head[idx]; j != -1; j = e[j].next)
		{
			int v = e[j].v;
			ll w = e[j].w;
			if (!vis[v] && dis[v] > dis[idx] + w)
				dis[v] = dis[idx] + w;
		}
	}
}

int id[10001];

int main()
{
	int s;
	while (scanf("%d", &n) == 1)
	{
		init();
		for (int i = 0; i < n; i++)
		{
			int u, k;
			scanf("%d%d", &u, &k);
			id[i] = u;
			if (u == 0)
				s = i;
			while (k--)
			{
				int v, w;
				scanf("%d%d", &v, &w);
				addedge(u, v, w);
			}
		}
		dijkstra(s);
		for (int i = 0; i < n; i++)
			printf("%d %lld\n", id[i], dis[i]);
	}
	return 0;
}

C++:                                           
#include<stdio.h>
#include<stdlib.h>
#define N_MAX 10001
struct node{
  int key;
  int cost;
  struct node *next;
};
typedef struct node *Gg;
Gg G[N_MAX];
Gg MNode(int key,int cost,Gg Node){
  Gg n;
  n=(Gg)malloc(sizeof(struct node));
  n->key=key;
  n->cost=cost;
  n->next=Node;
  return n;
}
Gg Insert(int s,int t,int u){
  Gg GG;
  GG=MNode(t,u,G[s]->next);
  G[s]->next=GG;
}
int main(){
  int i,j,n,count=0,v,c,c1,v1;
  int color[N_MAX],D[N_MAX],pi[N_MAX],minC,ii;
  Gg GG;
  scanf("%d",&n);
  for(i=0;i<n;i++)G[i]=MNode(0,0,NULL);
  for(i=0;i<n;i++){
    scanf("%d%d",&v,&c);
    for(j=0;j<c;j++){
      scanf("%d%d",&v1,&c1);
    Insert(i,v1,c1);
  }
}
for(i=0;i<n;i++){
  color[i]=0;
  pi[i]=-1;
  D[i]=10000001;
 }
 D[0]=0;

while(1){
  minC=10000001;
  for(i=0;i<n;i++){
    if(color[i]!=2&&D[i]<minC){
      minC=D[i];
      ii=i;
    }
  }
  if(minC==10000001)break;
  color[ii]=2;
  for(GG=G[ii];GG!=NULL;GG=GG->next){
    if(color[GG->key]!=2&&(GG->cost+D[ii])<D[GG->key]){
        pi[GG->key]=ii;
        D[GG->key]=GG->cost+D[ii];
        color[GG->key]=1;
    }
  }
 }
 for(i=0;i<n;i++)printf("%d %d\n",i,D[i]);
return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>

using namespace std;

static const int MAX = 10000;
static const int INFTY = (1<<20)
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n;
vector<pair<int,  int> > adj[MAX];

void dijkstra(){
priority_queue<pair<int, int> > PQ;
int color[MAX];
int d[MAX];
for(int i=0; i<n; i++){
d[i] = INFTY;
color[i] = WHITE;
}

d[0] = 0;
PQ.push(make_pair(0, 0));
color[0] = GARY;

while( !PQ.empty() ) {
pair<int, int> f = PQ.top(); PQ.pop();
int u = f.second;

color[u] = BLACK;

if(d[u] < f.first * (-1) ) continue;

for(int j=0; j<adj[u].size(); j++) {
int v = adj[u][j].first;
if(color[v] == BLACK) continue;
if(d[v] > d[u] + adj[u][j].second){
d[v] = d[u] + adj[u][j].second;

PQ.push(make_pair(d[v] * (-1), v));
color[v] = GARY;
}
}
}

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

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

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

dijkstra();

return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
using namespace std;

typedef vector<int>::iterator vitr;
typedef map<int, int>::iterator mitr;

map<int, int> w[100];
int d[100];

vector<int> a;
vector<int> b;

void findPath(){
    int candiW = INT_MAX;
    vitr candiI;
    for(vitr i=a.begin();i!=a.end();i++){
        for(vitr j=b.begin();j!=b.end();j++){
            mitr k = w[*i].find(*j);
            if(k == w[*i].end())continue;
            if(k->second + d[*i] < candiW){
                candiW = k->second + d[*i];
                candiI = j;
            }
        }
    }
    a.push_back(*candiI);
    d[*candiI] = candiW;
    b.erase(candiI);
}

int main(){
    int i,j,u,k,n,v,c;

    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d %d",&u,&k);
        for(j=0;j<k;j++){
            scanf("%d %d",&v,&c);
            w[u][v] = c;
        }
    }

    d[0] = 0;
    a.push_back(0);
    for(i=1;i<n;i++)b.push_back(i);

    for(i=1;i<n;i++)findPath();

    for(i=0;i<n;i++)printf("%d %d\n",i,d[i]);

    return 0;
}