Go: package main

import (
	"bufio"
	"container/heap"
	"fmt"
	"os"
	"strconv"
)

//make priority queue
type Item struct {
	id       int
	priority int // this state is priority and distans from start
	index    int
}

type PriorityQueue []*Item

func (pq PriorityQueue) Len() int { return len(pq) }

// we want the ascending-priority-queue.
// So we use less than here.
func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].priority < pq[j].priority
}

func (pq PriorityQueue) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
	pq[i].index = j
	pq[j].index = i
}

func (pq *PriorityQueue) Push(x interface{}) {
	n := len(*pq)
	item := x.(*Item)
	item.index = n
	*pq = append(*pq, item)
}

func (pq *PriorityQueue) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	item.index = -1 //for safety
	*pq = old[0 : n-1]
	return item
}

func (pq *PriorityQueue) update(dist int, id int) {
	for _, i := range *pq {
		if i.id == id {
			if i.priority > dist {
				i.priority = dist
			}
		}
	}
}

// the main code
func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())
	return n
}

func dikstra(dist [][]int, n int) []int {
	// preparate priority queue
	inf := 1 << 30
	pq := make(PriorityQueue, n)
	shortests := make([]int, n)
	for i := 0; i < n; i++ {
		pq[i] = &Item{
			id:       i,
			priority: inf,
			index:    i,
		}

		shortests[i] = inf
	}
	pq[0].priority = 0
	shortests[0] = 0

	for pq.Len() > 0 {
		item := heap.Pop(&pq).(*Item)
		shortests[item.id] = item.priority
		for id, d := range dist[item.id] {
			if d != -1 {
				pq.update(item.priority+d, id)
			}
		}
		heap.Init(&pq)
	}
	return shortests
}

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

	// init
	n := nextInt(sc)
	dist := make([][]int, n)
	for i := 0; i < n; i++ {
		dist[i] = make([]int, n)
		for j := 0; j < n; j++ {
			dist[i][j] = -1
		}
	}

	// std Input
	for i := 0; i < n; i++ {
		u := nextInt(sc)
		k := nextInt(sc)
		for j := 0; j < k; j++ {
			v, c := nextInt(sc), nextInt(sc)
			dist[u][v] = c
		}
	}

	shortests := dikstra(dist, n)
	for i, d := range shortests {
		fmt.Printf("%d %d\n", i, d)
	}
}

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 dtw[MAX],color[MAX];

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

    dtw[0]=0;
    PQ.push(make_pair(0,0));
    color[0]=GRAY;

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

        color[u]=BLACK;


        if(dtw[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(dtw[v]>dtw[u]+adj[u][j].second){
                dtw[v]=dtw[u]+adj[u][j].second;

                PQ.push(make_pair(dtw[v]*(-1),v));
                color[v]=GRAY;
            }
        }
    }
    
    for(int i=0;i<n;i++){
        cout<<i<<" "<<(dtw[i]==INFTY ? -1 : dtw[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 <iostream>
#include <limits.h>
#include <vector>
#include <queue>
 
using namespace std;
 
struct Node {
    int id;
    int cost;
    bool done;
    vector<int> next_node;
    vector<int> len_cost;
 
    bool operator<(const Node& right) const {
        return cost > right.cost;
    }
} node[10000];
 
int main() {
    int n, id, k;
 
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> id >> k;
        node[id].id = id;
        node[id].cost = INT_MAX;
        node[id].done = false;
        node[id].next_node.resize(k);
        node[id].len_cost.resize(k);
        for (int j = 0; j < k; j++) {
            cin >> node[id].next_node[j] >> node[id].len_cost[j];
        }
    }
 
    priority_queue<Node> q;
    node[0].cost = 0;
    q.push(node[0]);
    while (!q.empty()) {
        Node temp = q.top();
        q.pop();
 
        if (temp.done == true) {
            continue;
        }
        node[temp.id].done = true;
 
        for (int i = 0; i < temp.next_node.size(); i++) {
            int to = temp.next_node[i];
            int cost = temp.cost + temp.len_cost[i];
            if (node[to].cost > cost) {
                node[to].cost = cost;
                q.push(node[to]);
            }
        }
    }
 
    for (int i = 0; i < n; i++) {
        cout << i << " " << node[i].cost << endl;
    }
     
    return 0;
}

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

#define maxn 110
#define INFTY (1<<30)
#define WHITE 0
#define GRAY 1 //在本题中，这个可以去掉，无关紧要
#define BLACK 2
int n,m[maxn][maxn];

void dijkstra(int s) //从s开始求最短路径
{
    int minv,u;
    int d[maxn],p[maxn],color[maxn]; //在本题中，p数组起不到什么作用，可以去掉
    for(int i=0;i<n;i++) //初始化
    {
        d[i]=INFTY;
        p[i]=-1;
        color[i]=WHITE;
    }
    d[s]=0;

    while(1)
    {
        minv=INFTY;
        u=-1;

        for(int i=0;i<n;i++) //寻找最小顶点
        {
            if(color[i]!=BLACK&&d[i]<minv) //类似prim算法
            {
                minv=d[i];
                u=i;
            }
        }
        if(u==-1) break;
        color[u]=BLACK;

        for(int v=0;v<n;v++)
        {
            if(color[v]!=BLACK&&m[u][v]!=INFTY) //注意这里与prim算法的细微差别
            {
                if(d[u]+m[u][v]<d[v])
                {
                    d[v]=d[u]+m[u][v];
                    p[v]=u;
                    color[v]=GRAY;
                }
            }
        }
    }

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

int main()
{
    int k,u,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 <bits/stdc++.h>

using namespace std;

#define llong long long 
typedef struct data{
	vector<int> way;
	vector<int> waycost;
	int useway;
	int cost;
}data;

data d[10001];

void solve(int N, int before){
	vector<int> nsolve;
	for(int i = 0; i < d[N].way.size(); i++){
		int nway = d[N].way[i];
		if(d[N].cost + d[N].waycost[i] < d[nway].cost){
			d[nway].cost = min(d[d[N].way[i]].cost, d[N].cost + d[N].waycost[i]);
			d[nway].useway = N;
			nsolve.push_back(nway);
		}
	}
	for(int i = 0; i < nsolve.size(); i++){
		solve(nsolve[i],0);
	}
}

int main(){
	int hownum;
	cin >> hownum;
	for(int i = 0; i < hownum; i++){
		int num;
		int howway;
		cin >> num >> howway;
		for(int j = 0; j < howway; j++){
			int w,c;
			cin >> w >> c;
			d[num].way.push_back(w);
			d[num].waycost.push_back(c);
		}

		if(num == 0) d[num].cost = 0;
		else d[num].cost = 10000000;
	}

	for(int i = 0; i < hownum; i++){
		solve(i, -1);
	}
	
	for(int i = 0; i < hownum; i++){
		cout << i << " " << d[i].cost << endl;
	}
	return 0;
}