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
}

type Neighbor struct {
	node   int
	weight 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{0}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Printf("%d %d\n", v.getEnd(), v.shortest)
	}
}

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

func createAdjacentMatrix(n int, sc *bufio.Scanner) ([][]Neighbor, error) {
	adjacentMatrix := make([][]Neighbor, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		adjacentMatrix[id] = []Neighbor{}
		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] = append(adjacentMatrix[id], Neighbor{v, c})
		}
	}
	return adjacentMatrix, nil
}

func sssp(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]Neighbor) {
	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]
}

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] = shortestInfo
}

func findAdjacents(currentNode int, adjacentMatrix [][]Neighbor) []Edge {
	adjacents := adjacentMatrix[currentNode]
	edges := []Edge{}
	for _, neighbor := range adjacents {
		edges = append(edges, Edge{start: currentNode, end: neighbor.node, weight: neighbor.weight})
	}
	return edges
}

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

C++: #include <iostream>
#include <vector>
#include <climits>
#include <queue>

using namespace std;

const int kSize = 100001;

vector<int> V;

struct Node {
    int to;
    int weight;

    Node(int _to, int _weight) {
        to = _to;
        weight = _weight;
    }
};

int n;
vector<Node> adj[kSize];
bool isMarked[kSize];
int tree[kSize];
int dis[kSize];

void Dijkstra(int s) {
    dis[s] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<> > pq;

    pq.push(make_pair(s, 0));
    //isMarked[s] = true;
    tree[s] = s;

    while (!pq.empty()) {
        pair<int, int> p = pq.top();
        pq.pop();
        int from = p.first;
        for (int i = 0; i < adj[from].size(); ++i) {
            int to = adj[from][i].to;
            if (dis[from] + adj[from][i].weight < dis[to]) {
                dis[to] = dis[from] + adj[from][i].weight;
                tree[to] = from;
                pq.push(make_pair(to, dis[to]));
            }
        }
    }

}

int main() {
    fill(isMarked, isMarked + kSize, false);
    fill(dis, dis + kSize, INT_MAX);
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int u, k;
        cin >> u >> k;
        for (int j = 0; j < k; ++j) {
            int v, c;
            cin >> v >> c;
            adj[u].emplace_back(v, c);
        }
    }

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

C++: #include<bits/stdc++.h>
using namespace std;
static const int INF=1000000;

int n;
vector<pair<int,int> > nex[10000];

void dijkstra(){ 
  priority_queue<pair<int,int> >PQ;
  int d[10000];
  int color[10000];  
  for(int i=0;i<n;i++){
    d[i]=INF;
    color[i]=0;
  }
  
  color[0]=1;
  d[0]=0;
  PQ.push(make_pair(0, 0));
  
  while( !PQ.empty() ){
    pair<int,int> f = PQ.top();PQ.pop();
    int u =f.second;
    color[u]=2;
    if(d[u] < f.first *(-1)) continue;
    
    for(int j=0;j<nex[u].size();j++){
      int v=nex[u][j].first;
      if(color[v] == 2) continue;
      if(d[v]>d[u]+nex[u][j].second){
        d[v]=d[u]+nex[u][j].second;
        PQ.push(make_pair(d[v]*(-1),v));
        color[v]=1;
      }
    }
  }
  for(int i=0;i<n;i++){
    cout<<i<<" "<<(d[i] == INF ?:d[i])<<endl;
  }
}


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

C++: #include <vector>
#include <queue>
#include <stdio.h>
#include <iostream>
#include <limits>

using namespace std;

const int MAXN = 10000;
const int INF = numeric_limits<int>::max();

vector< pair<int, int> > G[MAXN];
int dist[MAXN];
int n;

void dijkstra(int start) {
  for (int i = 0; i < n; ++i) dist[i] = INF;

  priority_queue< pair<int, int>, vector< pair<int, int> >, greater< pair<int, int> > > q;
  q.emplace(0, start);
  dist[start] = 0;
  while (!q.empty()) {
    pair<int, int> cur = q.top(); q.pop();
    int v = cur.second;
    int cost = cur.first;
    if (dist[v] < cost) continue;

    for (size_t i = 0; i < G[v].size(); ++i) {
      int u = G[v][i].first;
      int new_cost = G[v][i].second + cost;
      if (dist[u] > new_cost) {
	q.emplace(new_cost, u);
	dist[u] = new_cost;
      }
    }
  }
}
int main () {
  cin >> n;

  for (int i = 0; i < n; ++i) {
    int u, k;
    cin >> u >> k;
    for (int j = 0; j < k; ++j) {
      int v, c;
      cin >> v >> c;
      G[u].emplace_back(v, c);
    }
  }
  dijkstra(0);
  for (int i = 0; i < n; ++i) {
    cout << i << " " << dist[i] << endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
struct edge{
  int to,cost;
};
typedef pair<int,int> P;
int V;
vector<edge> G[100000];
int d[100000];
void dijkstra(int s){
  priority_queue<P ,vector<P>,greater<P> >que;
  fill(d,d+V,1e9+1);
  d[s]=0;
  que.push(P(0,s));
  //
  while(!que.empty()){
    P p=que.top();
    que.pop();
    int v=p.second;
    if(d[v]<p.first)continue;

    for(int i=0;i<G[v].size();i++){
      edge e=G[v][i];
      if(d[e.to]>d[v]+e.cost){
        d[e.to]=d[v]+e.cost;
        que.push(P(d[e.to],e.to));
      }
    }
  }
}
int main(){
  int k,u,v,c;
  cin >> V;
  for(int i=0;i<V;i++){
    cin >> u >> k;
    for(int j=0;j<k;j++){
      cin >> v >> c;
      edge ed;
      ed.to=v;
      ed.cost=c;
      G[u].push_back(ed);
    }
  }
  dijkstra(0);
  for(int i=0;i<V;i++){
    cout << i << " " << d[i] << endl;
  }
  return 0;
}