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<cstring>
#include<algorithm>
using namespace std;

int x[10000][2000];
int x2[10000][2000];
int y[10000];
int z[10000];

int main() {
	memset(x, 1, sizeof(x));
	memset(y, 1, sizeof(y));
	int n, a, b, c, d;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a >> b;
		for (int i = 0; i < b; i++) {
			cin >> c >> d;
			x[a][z[a]] = c;
			x2[a][z[a]] = d;
			z[a]++;
		}
	}
	y[0] = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			for (int k = 0; k < z[j]; k++) {
				y[x[j][k]] = min(y[x[j][k]], y[j] + x2[j][k]);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		cout << i << ' ' << y[i] << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <queue>
#define INF 10000000
#define MAX 10000
using namespace std;

// ====== Implement of Heap ======
int heap[2000000]={INF};
int eoh=1;

void minHeapify(int* A, int i){
  int h = eoh-1;
  int l = 2*i;
  int r = 2*i+1;
  int smallest;
  if ( l <= h && A[l] < A[i] )
    smallest = l;
  else
    smallest = i;

  if ( r<= h && A[r] < A[smallest])
    smallest = r;

  if (smallest != i){
    swap(A[i], A[smallest]);
    minHeapify(A, smallest);
  }
}

void insert(int v, int p=-1){
  if (p == -1){
    p = eoh++;
    heap[p] = v;
    insert(v, p);
    return;
  }
  if (p == 1)
    return;
  int parent = heap[p/2];
  if (parent < v)
    return;
  swap(heap[p/2], heap[p]);
  insert(v, p/2);
}

int del(void){
  if (eoh == 1)
    return -1;
  int res = heap[1];
  heap[1] = heap[eoh-1];
  eoh--;
  minHeapify(heap, 1);
  return res;
}
// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ 

// ====== Implement of List Structure ======
struct Node {
    int to, cost;
    struct Node * next;
};

typedef struct Node * NodePointer;

NodePointer NIL;

NodePointer makeNode(int to, int cost){
    NodePointer newNode = (NodePointer)malloc(sizeof(struct Node));
    newNode->to = to;
    newNode->cost = cost;
    newNode->next = NIL;
    return newNode;
}

NodePointer insert(NodePointer head, int to, int cost){
    NodePointer ite, newNode;
    for (ite=head;ite->next!=NIL;ite=ite->next);
    newNode = makeNode(to, cost);
    ite->next = newNode;
    return newNode;
}


// decl vals
int dist[MAX];

void dijkstraAlgorithm(NodePointer vertex[], int n){
  auto compare = [=](int i, int j){return dist[i] >= dist[j];};
  priority_queue<int, vector<int>,  decltype(compare)> searchQueue {compare}; 

  // Initialize of distance, previous and Push all of vectex to queue 
  dist[0] = 0;
  for (int i=0;i<n;i++){
    if (i!=0) dist[i] = INF;
    searchQueue.push(i);
  }

  while(!searchQueue.empty()){
    int current = searchQueue.top();
    NodePointer ite;
    searchQueue.pop();
    for (ite=vertex[current]->next;ite!=NIL;ite=ite->next){
      int alt = dist[current]+ite->cost;
      if ( dist[ite->to] > alt ){
        dist[ite->to] = alt;
        searchQueue.push(ite->to);
      }
    }
  }
}

int main(){
  NodePointer vertex[MAX];
  int i, n;
  cin >> n;
  NIL = makeNode(0, 0);
  for(i=0;i<n;++i) vertex[i] = makeNode(-1,INF);
  
  for (int i=0;i<n;++i){
    int id, k;
    scanf("%d%d", &id, &k);
    for (int j=0;j<k;++j){
      int node, cost;
      scanf("%d%d", &node, &cost);
      insert(vertex[id], node, cost);
    }
  }

  dijkstraAlgorithm(vertex, n);

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

  return 0;
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;

#define BIG_NUM 2000000000

using namespace std;

struct Node{

	Node(int arg_to,int arg_cost){
		to = arg_to;
		cost = arg_cost;
	}
	bool operator<(const struct Node &arg) const{
			return cost > arg.cost;
	};

	int to,cost;
};

int main(){

	int N;
	scanf("%d",&N);

	vector<Node> V[N];

	int node,num,to,cost,D[N];;

	for(int loop = 0; loop < N; loop++){
		scanf("%d",&node);
		scanf("%d",&num);
		for(int i = 0; i < num; i++){
			scanf("%d %d",&to,&cost);
			V[node].push_back(Node(to,cost));
		}
		D[loop] = BIG_NUM;
	}

	D[0] = 0;

	bool visited[N];
	for(int i = 1; i < N; i++)visited[i] = false;
	visited[0] = true;

	priority_queue<Node> Q;

	for(int i = 0; i < V[0].size(); i++){
		D[V[0][i].to] = V[0][i].cost;
		Q.push(Node(V[0][i].to,V[0][i].cost));
	}

	int min_index;

	while(!Q.empty()){
		if(Q.top().cost == D[Q.top().to]){
			min_index = Q.top().to;
			Q.pop();
		}else{
			Q.pop();
			continue;
		}

		for(int k = 0; k < V[min_index].size(); k++){ //min_index?????????????????´?????§????????¨??´??°??§??????????????§???min_index?????????????????¨?????????????????¢???
			if(D[V[min_index][k].to] > D[min_index] + V[min_index][k].cost){
				D[V[min_index][k].to] = D[min_index] + V[min_index][k].cost;
				Q.push(Node(V[min_index][k].to,D[V[min_index][k].to]));
			}
		}
	}

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

    return 0;
}