Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

const (
	MAX_N      = 100
	MAX_WEIGHT = 100000
)

type Edge struct {
	start  int
	end    int
	weight int
}

type ShortestInfo struct {
	edges    []Edge
	shortest 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{1}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Printf("%d %d\n", v.getEnd()-1, v.shortest)
	}
}

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

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

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

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

func findAdjacents(currentNode int, adjacentMatrix [][]int) []Edge {
	adjacents := adjacentMatrix[currentNode-1]
	edges := []Edge{}
	for i, v := range adjacents {
		if v > 0 {
			edges = append(edges, Edge{start: currentNode, end: i + 1, weight: v})
		}
	}
	return edges
}

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

C++: aa

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define MAX_V 100
#define INF 1e9
using namespace std;
int cost[MAX_V][MAX_V];
int d[MAX_V];
bool used[MAX_V];
int V;
void dijkstra(int s)
{
	for (int i = 0; i < MAX_V; i++)

	{
		d[i] = INF;
		used[i] = false;
	}
	d[s] = 0;

	while (true)
	{
		int v = -1;
		for (int u = 0; u < V; u++)
		{
			if (!used[u] && (v == -1 || d[u] < d[v]))
			{
				v = u;
			}
		}
		if (v == -1)
		{
			break;
		}
		used[v] = true;

		for (int u = 0; u < V; u++)
		{
			d[u] = min(d[u], d[v] + cost[v][u]);
		}


	}
}
int main()
{
	for (int i = 0; i < V; i++)
	{
		int u;
		cin >> u;
		int k;
		cin >>  k;
		for (int j = 0; j < k; j++)

		{
			int v;
			cin >> v;
			int c;
			cin >> c;
			cost[u][v] = c;

		}
	}

	dijkstra(0);

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

}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#define N 100000
const int INF = 1 << 30; // > 10^9
int n;
using namespace std;
struct edge : vector<pair<int, int> > {
    void add_edge(int to, int cost) {
        push_back(pair<int, int>(to, cost));
    }
} info[N];
void bfs();
int hoge[N];
int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        int u, k;
        cin >> u >> k;
        while (k--) {
            int v, c;
            cin >> v >> c;
            info[u].add_edge(v, c);
        }
    }
    bfs();
    for (int i = 0; i < n; i++) {
        cout << i << " " << hoge[i] << endl;
    }
}
void bfs() {
    fill_n(hoge, n, INF); //hoge ~ hoge + v <- INF
    queue<int> que;
    que.push(0);
    hoge[0] = 0;
    while (!que.empty()) {
        int p = que.front();
        que.pop();
        for (int i = 0; i < info[p].size(); i++) {
            if (info[p][i].second + hoge[p] < hoge[info[p][i].first]) {
                que.push(info[p][i].first);
                hoge[info[p][i].first] = info[p][i].second + hoge[p];
            }
        }
    }
    
}

C++: #include <stdio.h>
#include <vector>
#include <utility>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;

int main(void) {
  int n, ans = 0;
  scanf("%d", &n);
  int dis[n];
  rep(i, n) dis[i] = 10e7;
  dis[0] = 0;
  vector< pair<int, int> > vec[n];
  rep(i, n) {
    int u, k;
    scanf("%d%d", &u, &k);
    rep(j, k) {
      int c, v;
      scanf("%d%d", &v, &c);
      pair<int, int> p = make_pair(v, c);
      vec[u].push_back(p);
    }
  }
  /*rep(i, n) {
    vector< pair<int, int> >::iterator it;
    for(it = vec[i].begin(); it != vec[i].end(); ++it) printf("%d:%d ", (*it).first, (*it).second);
    printf("\n");
  }*/
  rep(i, n - 1) {
    rep(j, n) {
      vector< pair<int, int> >::iterator it;
      for(it = vec[j].begin(); it != vec[j].end(); ++it) {
        if(dis[(*it).first] > dis[j] + (*it).second) dis[(*it).first] = dis[j] + (*it).second;
      }
    }
    /*rep(j, n) printf("%d ", dis[j]);
    printf("\n");*/
  }
  rep(i, n) printf("%d %d\n", i, dis[i]);
  return 0;
}

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

#define inf 500000
using namespace std;

int main() {
    int n, tmp, tweight, kazu;
    int g[100][100] = {};//与えられるグラフ
    cin >> n;

    //初期化
    int d[100] = {};
    for (int i = 1; i < n; ++i) {
        d[i] = inf;
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            g[i][j] = -1;
        }
    }
    for (int i = 0; i < n; ++i) {
        g[i][i] = 0;
    }

    //入力を受け取る
    for (int i = 0; i < n; ++i) {
        cin >> tmp;
        cin >> kazu;
        for (int j = 0; j < kazu; ++j) {
            cin >> tmp >> tweight;
            g[i][tmp] = tweight;
        }
    }
    /*
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << g[i][j] << " ";
        }
        cout << endl;
    }
     */

    for (int k = 0; k < n; ++k) {

        for (int i = 0; i < n; ++i) { // i 今最短経路を求めているノード
            /*
            for (int l = 0; l < n; ++l) {
                cout << d[i] << " ";
            }
            cout << endl;
             */
            for (int j = 0; j < n; ++j) { // j k の組でその２点間の重み
                //cout << i << " " << d[i] << " " << d[j] << " " << g[j][i] << endl;
                if (d[i] > d[j] + g[j][i] && g[j][i] != -1) {
                    d[i] = d[j] + g[j][i];

                }
            }
        }

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

    return 0;
}