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 <queue>
#include <algorithm>

using namespace std;

static const int N = 10000;
static const int INF = 1000000;

struct Vertex {
    int id;
    bool in_S;
    int min_cost;
};

bool operator>(const Vertex &vertex1, const Vertex &vertex2)
{
    return vertex1.min_cost > vertex2.min_cost;
}


class SSSP {
private:
    vector<pair<int, int> > adj[N];
    Vertex vertex[N];
    int n;

public:
    SSSP()
    {
        cin >> n;
        int id;
        int degree;
        int v;
        int c;
        for (int i = 0; i < n; i++)
        {
            cin >> id;
            vertex[id].id = id;
            cin >> degree;
            for (int j = 0; j < degree; j++)
            {
                cin >> v >> c;
                adj[id].push_back(make_pair(v, c));
            }
        }
    }

    void dijkstra(int start)
    {
        priority_queue<Vertex, vector<Vertex>, greater<Vertex> > PQ;
        for (int i = 0; i < n; i++)
        {
            vertex[i].in_S = false;
            vertex[i].min_cost = INF;
        }
        vertex[start].min_cost = 0;

        PQ.push(vertex[start]);

        while (!PQ.empty())
        {
            int u = PQ.top().id;
            int cost = PQ.top().min_cost;
            PQ.pop();

            vertex[u].in_S = true;

            if (vertex[u].min_cost < cost)
                continue;

            for (int j = 0; j < adj[u].size(); j++)
            {
                int v = adj[u][j].first;
                if (!vertex[v].in_S)
                {
                    if (vertex[u].min_cost + adj[u][j].second < vertex[v].min_cost)
                    {
                        vertex[v].min_cost = vertex[u].min_cost + adj[u][j].second;
                        PQ.push(vertex[v]);
                    }
                }
            }
        }
    }

    void print()
    {
        for (int i = 0; i < n; i++)
            cout << i << " " << (vertex[i].min_cost == INF ? -1 : vertex[i].min_cost) << endl;
    }
};

int main()
{
    SSSP mst;
    mst.dijkstra(0);
    mst.print();
}

C++: #include <iostream>
#include <queue>
#include <vector>
#define INF 1<<30
#define WHITE 0
#define BLACK 1
using namespace std;

int main(int argc, char* argv[]) {
    int n, u, k, v, c;
    cin >> n;

    int color[n];
    int d[n];
    vector <pair<int, int>> Adj[n];
    priority_queue <pair<int, int>> que;
    pair<int, int> top;

    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));
        }
        d[i] = INF;
        color[i] = WHITE;
    }

    d[0] = 0;
    que.push(make_pair(0, 0));

    while (!que.empty()){
        top = que.top();
        que.pop();
        c = (-1)*top.first;
        u = top.second;

        color[u] = BLACK;
        for (int j = 0; j < Adj[u].size(); j++){
            int v = Adj[u][j].first;
            int w = Adj[u][j].second;

            if (color[v]) continue;
            if (d[u] + w < d[v]){
                d[v] = d[u] + w;
                que.push(make_pair((-1)*d[v], v));
            }
        }
    }
    for (int i = 0; i < n; i++)
        cout << i << " " << (d[i] == INF? -1: d[i]) << endl;

    return 0;
}

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

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


int n, M[MAX][MAX];

void dijkstra() {
    int minv;
    int d[MAX], color[MAX];

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

    d[0] = 0;
    color[0] = GRAY;

    while(1) {
        minv = INFTY;
        int u = -1;
        for (int i = 0; i < n; i++) {
            if (minv  > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1 ) {
            break;
        }
        color[u] = BLACK;
        for (int v = 0; v < n; v++) {
            if (d[v] > d[u] +M[u][v]) {
                d[v] = d[u] + M[u][v];
                color[v] = GRAY;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        cout << i << " " << ( d[i] == INFTY ? -1 : d[i] ) << endl;
    }
}

int main(int argc, char const* argv[])
{
    cin >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            M[i][j] = INFTY;
        }
    }

    int k, c, u, v;
    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();
    return 0;
}