Go: package main

import (
	"fmt"
	"os"
	"bufio"
	"strings"
	"strconv"
)
var MAX = 1000000
type Vertex struct{
	Value int
	Routes map[int]int
	Done bool
}
func NewVertex(value int) *Vertex{
	routes := make(map[int]int)
	// for i, _ := range routes {
	// 	routes[i] = MAX
	// }
	return &Vertex{ value, routes, false }
}

func (v *Vertex) SetRoute(key, weight int) {
	v.Routes[key] = weight
}

type Path struct {
	Key int
	Weight int
}

var count = 0
func ShortestRoutes(list []*Vertex) []int {
	// create result table
	result  := make([]int, len(list))
	// fmt.Println(result)
	for i, _ := range result {
		result[i] = MAX
	}

	queue := make([]Path, 0)
	queue = append(queue, Path{0, 0})
	result[0] = 0

	for len(queue) != 0 {
		count++
		path := queue[0]
		queue = queue[1:]
		for key, weight := range list[path.Key].Routes {
			// fmt.Println(list[path.Key].Routes)
			// set to result
			// fmt.Printf("Path(%d, %d) ? result[%d] => %d, wieght: %d\n", path.Key, path.Weight, key, result[key], weight)
			if path.Weight + weight < result[key] {
				result[key] = path.Weight + weight 
				queue = append(queue, Path{key, result[key]})
			// } else if !list[key].Done {
			// 	queue = append(queue, Path{key, result[key]})
			}
		}
		list[path.Key].Done = true
	}
	return result
}
func main() {
	var n int
	fmt.Scanf("%d", &n)
	list := make([]*Vertex, n)
	scanner := bufio.NewScanner(os.Stdin)
	for i := 0; i < n; i++ {
		scanner.Scan()
		elements := strings.Split(scanner.Text(), " ")
		value, _ := strconv.Atoi(elements[0])
		list[i] = NewVertex(value)
		for j := 2; j < len(elements); j += 2 {
			key, _    := strconv.Atoi(elements[j])
			weight, _ := strconv.Atoi(elements[j + 1])
			list[i].SetRoute(key, weight)
		}
	}

	result := ShortestRoutes(list)
	for i := 0; i < len(result); i++ {
		fmt.Printf("%d %d\n", i, result[i]);
	}
	// fmt.Printf("count: %d\n", count)
}

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

using namespace std;

#define MAX 10000
#define INF 1000000
#define pii pair<int,int>

vector<pii> eclist[MAX];//[[index,cost]]

void bfs(int start,int n){
    queue<int> q; // index
    vector<bool> visited(n, false);
    q.push(start);
    while (!q.empty()){
        int u = q.front();q.pop();
        visited[u] = true;
        for (pii vpair : eclist[u]) {
            int v = vpair.first;
            if(!visited[v]){
                q.push(v);
            }
        }
    }
}

void dijkstra_print_distance(int start, int n){
    priority_queue<pii> q; // cost,index
    vector<int> costs(n,INF);
    vector<bool> visited(n, false);
    costs[0] = 0;
    q.push(make_pair(0, start));
    while (!q.empty()){
        pii upair = q.top();q.pop();
        int u = upair.second,ucost = upair.first * -1;
        visited[u] = true;
        if( costs[u] < ucost) {
            continue;
        }
        for (pii vpair : eclist[u]) {
            int v = vpair.first,vcost = vpair.second;
            if(visited[v])continue;
            if (costs[v] > costs[u] + vcost){
                costs[v] = costs[u] + vcost;
                q.push(pii(costs[v] * -1, v));
            }
        }
    }
    for (int i = 0; i < n; ++i) cout << i << " " << costs[i] << endl;
}

int main(){
    int n;
    freopen("in", "r", stdin);
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int id,m,v,c;
        cin >> id >> m;
        for (int j = 0; j < m; ++j) {
            cin >> v >> c;
            eclist[id].push_back(pair<int,int>(v,c));
        }
    }

    dijkstra_print_distance(0, n);

    return 0;
}

C++: #include<iostream>
#include<climits>
#include<vector>
#include<queue>
using namespace std;

enum Color{WHITE, GRAY, BLACK};
struct edge{
        int v,c;
        edge(int v, int c): v(v), c(c){}
};
bool operator< (const edge &e, const edge &f){return e.c<f.c;}

int n;
vector<vector<edge>> a;
int *r;

void dijkstra(){
        Color color[n];
        for(int i=0;i<n;i++) color[i]=WHITE;
        color[0] = GRAY;
        priority_queue<edge> pq;
        pq.push(edge(0,0));
        while(!pq.empty()){
                edge e = pq.top(); pq.pop();
                if(color[e.v]==BLACK) continue;
                color[e.v] = BLACK;
                r[e.v] = - e.c;

                for(int i=0;i<a[e.v].size();i++){
                        edge f = a[e.v][i];
                        if(color[f.v]==BLACK) continue;
                        color[f.v] = GRAY;
                        int cost = e.c - f.c;
                        pq.push(edge(f.v, cost));
                }
        }

}

int main(){
        int u,k,v,c;
        cin>>n;
        a = vector<vector<edge>>(n);
        r = new int [n];
        for(int i=0;i<n;i++){
                cin>>u>>k;
                for(int j=0;j<k;j++){
                        cin>>v>>c;
                        a[u].emplace_back(edge(v,c));
                }
        }

        dijkstra();

        for(int i=0;i<n;i++)
                cout<<i<<" "<<r[i]<<endl;
        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] = GRAY;

	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[v] + adj[u][j].second) {
				d[v] = d[u] + adj[u][j].second;
				PQ.push(make_pair(d[v] * (-1), v));
				color[v] = GRAY;
			}
		}
	}

	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 <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <sstream>
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;

int *c;

struct job {
	int id;
	job(int i){
		this->id = i;
	}
	bool operator<(job j) const {
		return c[this->id] > c[j.id];
	}
};

int main() {
	int n;
	scanf("%d", &n);
	
	c = new int[n];
	vector<vector<pair<int, int> > > paths;
	
	for(int i = 0; i < n; i++){
		int u, k;
		scanf("%d %d", &u, &k);
		
		vector<pair<int, int> > path;
		c[u] = u ? INT_MAX : 0;
		while(k--){
			int v, c;
			scanf("%d %d", &v, &c);
			path.push_back(make_pair(v, c));
		}
		paths.push_back(path);
	}
	
	priority_queue<job> q;
	q.push(job(0));
	while(q.size()){
		int i = q.top().id;
		q.pop();
		
		for(int j = 0; j < paths[i].size(); j++){
			int dest = paths[i][j].first;
			int cost = paths[i][j].second;
			if(c[dest] > c[i] + cost){
				c[dest] = c[i] + cost;
				q.push(job(dest));
			}
		}
	}
	
	for(int i = 0; i < n; i++){
		printf("%d %d\n", i, c[i]);
	}
}