Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"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
}

func main() {
	doMain(os.Stdin)
}

func doMain(reader io.Reader) {
	sc := bufio.NewScanner(reader)
	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.Println(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) ([][]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]
}

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 [][]int) []Edge {
	adjacents := adjacentMatrix[currentNode]
	edges := []Edge{}
	for i, v := range adjacents {
		if v >= 0 {
			edges = append(edges, Edge{start: currentNode, end: i, weight: v})
		}
	}
	return edges
}

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

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

using namespace std;

struct Node {
    int cost = INT_MAX;
    int color = 0;
    vector<int> next_node;
    vector<int> len_cost;
} node[100];

int main() {
    int n, id, k;

    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> id >> k;
        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];
        }
    }

    int size1, size2;
    vector<int> vec;
    node[0].cost = 0;
    node[0].color = 1;
    vec.push_back(0);
    while (1) {
        size1 = vec.size();
        if (size1 == n) {
            break;
        }
        for (int i = 0; i < size1; i++) {
            size2 = node[vec[i]].next_node.size();
            for (int j = 0; j < size2; j++) {
                if (node[node[vec[i]].next_node[j]].cost > node[vec[i]].cost + node[vec[i]].len_cost[j]) {
                    node[node[vec[i]].next_node[j]].cost = node[vec[i]].cost + node[vec[i]].len_cost[j];
                }
            }
        }
        int min = INT_MAX, mini;
        for (int i = 0; i < size1; i++) {
            size2 = node[vec[i]].next_node.size();
            for (int j = 0; j < size2; j++) {
                if (min > node[node[vec[i]].next_node[j]].cost && node[node[vec[i]].next_node[j]].color == 0) {
                    min = node[node[vec[i]].next_node[j]].cost;
                    mini = node[vec[i]].next_node[j];
                }
            }
        }
        vec.push_back(mini);
        node[mini].color = 1;
    }

    for (int i = 0; i < n; i++) {
        cout << i << " " << node[i].cost << endl;
    }
    
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dyy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

int n;
vector<vector<pint>> g (10005);

void dijkstra() {
    int d[n];
    bool seen[n] = {};
    rep (i, n) d[i] = inf;
    d[0] = 0;
    priority_queue<pint, vector<pint>, greater<pint>> pq;
    pq.push ({0, 0});

    while (!pq.empty()) {
        pint f = pq.top();
        pq.pop();
        int u = f.second; // firstはコスト,secondは場所
        seen[u] = 1;

        if (d[u] < f.first) continue;
        // cout << u << " " << d[u] << "\n";
        rep (i, g[u].size()) {
            int v = g[u][i].second;
            if (!seen[v] && d[v] > d[u] + g[u][i].first) {
                d[v] = d[u] + g[u][i].first;
                pq.push ({d[v], v});
            }
        }
    }
    rep (i, n) cout << i << " " << d[i] << "\n";
}

int main() {
    cin >> n;
    rep (i, n) {
        int now, k, v, c;
        cin >> now >> k;
        rep (j, k) {
            cin >> v >> c;
            g[now].push_back ({c, v});
        }
    }
    dijkstra();
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#include <queue>
#include <functional>
#define N 101
#define INF 2000000000
using namespace std;

int dist[N];
typedef pair<int,int> pii;

std::vector<pii> e1[N];
std::vector<pii> e2[N];

int dijk1(int a,int b){
	dist[a]=0;
	std::priority_queue<pii> pq;
	for(int i=0;i<e2[a].size();i++){
		pq.push(e2[a][i]);
	}
	while(!pq.empty()){
		pii temp=pq.top();
		int now=temp.second;
		int c=temp.first;
		pq.pop();
		if(dist[now]!=INF)continue;
		dist[now]=-c;
		if(now==b)break;
		for(int i=0;i<e2[now].size();i++){
			pq.push(make_pair(c+e2[now][i].first,e2[now][i].second));
		}
	}
	return dist[b];
}

int dijk(int a,int b){
	dist[a]=0;
	std::priority_queue<pii> pq;
	for(int i=0;i<e1[a].size();i++){
		pq.push(e1[a][i]);
	}
	while(!pq.empty()){
		pii temp=pq.top();
		int now=temp.second;
		int c=temp.first;
		pq.pop();
		if(dist[now]!=INF)continue;
		dist[now]=-c;
		if(now==b)break;
		for(int i=0;i<e1[now].size();i++){
			pq.push(make_pair(c+e1[now][i].first,e1[now][i].second));
		}
	}
	return dist[b];
}

int main(void){
	int a,b,c,d;
	int n,m;
	while(cin>>n>>m,n||m){
		for(int i=0;i<n;i++){
			cin>>a>>b>>c>>d;
			e1[a].push_back(make_pair(-c,b));
			e2[a].push_back(make_pair(-d,b));
		}
		int k;
		cin>>k;
		while(k--){
			for(int i=1;i<=m;i++)dist[i]=INF;
			cin>>a>>b>>c;
			if(c) cout<<dijk1(a,b)<<endl;
			else cout<<dijk(a,b)<<endl;
			// for(int i=1;i<=m;i++)printf("dist[%d]:%d\n",i,dist[i]);
		}
	}
	return 0;
}