Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

var infty = 1000000000

type DirectedGraphNodeID int

type DirectedGraphNode struct {
	key         DirectedGraphNodeID
	adjacents   []*DirectedGraphNode
	costs       []int
	distance    int
	predecessor *DirectedGraphNode
}

func newDirectedGraph(nNodes int) *DirectedGraph {
	graph := DirectedGraph{}
	graph.nodes = make([]*DirectedGraphNode, nNodes)
	for i := 0; i < nNodes; i++ {
		node := DirectedGraphNode{}
		node.key = DirectedGraphNodeID(i)
		node.distance = infty
		graph.nodes[i] = &node
	}
	return &graph
}

type DirectedGraph struct {
	nodes []*DirectedGraphNode
}

func (g *DirectedGraph) setAdjacency(i, j DirectedGraphNodeID, cost int) {
	g.nodes[i].adjacents = append(g.nodes[i].adjacents, g.nodes[j])
	g.nodes[i].costs = append(g.nodes[i].costs, cost)
}

func (g *DirectedGraph) print() {
	for i := 0; i < len(g.nodes); i++ {
		node := g.nodes[i]
		key := node.key
		strings := []string{strconv.Itoa(int(key)), strconv.Itoa(node.distance)}
		for j := 0; j < len(node.adjacents); j++ {
			nodeJ := fmt.Sprintf("(%v, %v)", node.adjacents[j].key, node.costs[j])
			strings = append(strings, nodeJ)
		}
		fmt.Printf("%v\n", strings)
	}
}

func (g *DirectedGraph) relaxEdge(l, r *DirectedGraphNode, w int) {
	if r.distance > l.distance+w {
		// fmt.Printf("%v -> %v, %v\n", l.key, r.key, l.distance+w)
		r.distance = l.distance + w
		r.predecessor = l
	}
}

func main() {
	scanner.Split(bufio.ScanWords)

	nNodes := nextInt()
	graph := newDirectedGraph(nNodes)

	for i := 0; i < nNodes; i++ {
		iNode := DirectedGraphNodeID(nextInt())
		nAdjacent := nextInt()
		for j := 0; j < nAdjacent; j++ {
			jNode := DirectedGraphNodeID(nextInt())
			cost := nextInt()
			graph.setAdjacency(iNode, jNode, cost)
		}
	}

	graph.nodes[0].distance = 0
	for iNode := 0; iNode < nNodes; iNode++ {
		for iLeft := 0; iLeft < len(graph.nodes); iLeft++ {
			nodeLeft := graph.nodes[iLeft]
			for iRight := 0; iRight < len(nodeLeft.adjacents); iRight++ {
				nodeRight := nodeLeft.adjacents[iRight]
				cost := nodeLeft.costs[iRight]
				graph.relaxEdge(nodeLeft, nodeRight, cost)
			}
		}
	}

	// graph.print()

	for iNode := 0; iNode < len(graph.nodes); iNode++ {
		node := graph.nodes[iNode]
		fmt.Println(node.key, node.distance)
	}
}

C++: #include<iostream>
#include<sstream>
#include<vector>
#include<climits>

using namespace std;

struct E
{
	int from, to;
	long cost;
};

int main(){
	ostringstream out;

	int n, u, k;
	cin >> n;

	vector<long> d(n);
	vector<E> e;

	fill(d.begin(),d.end(),LONG_MAX);
	d[0]=0;

	for(int i=0;i<n;i++){
		cin >> u >> k;
		for(int j=0;j<k;j++){
			E es={u,0,0};
			cin >> es.to >> es.cost; 
			e.push_back(es);
		}
	}

	while(true){
		bool update=false;
		for(int i=0;i<e.size();i++){
			if(d[e[i].from]!=LONG_MAX&&d[e[i].to]>d[e[i].from]+e[i].cost){
				d[e[i].to]=d[e[i].from]+e[i].cost;
				update=true;
			}
		}
		if(!update)break;
	}

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

	cout << out.str();
	return 0;
}

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

const int WHITE = 0;
const int GRAY = 1;
const int BLACK = 2;

int n;
vector<vector<int>> G;
vector<int> d;
vector<int> p;
vector<int> colors;

void sssp(int s){
    d[s] = 0;
    while(true){
        int cur_min = INT_MAX;
        int min_id = -1;
        for(int i =0;i<n;i++){
            if(colors[i]!=BLACK && d[i] < cur_min){
                min_id = i;
                //printf("%d %d\n",cur_min,d[i]);
                cur_min = d[i];
            }
        }
        if(min_id==-1) break;
        int u = min_id;
        colors[u] = BLACK;
        for(int v = 0;v<n;v++){
            if(colors[v] !=BLACK && G[u][v]!=INT_MAX){
                if(d[u]+G[u][v] < d[v]){
                    d[v] = d[u]+G[u][v];
                    p[v] = u;
                }
            }
        }
    }
    for(int i =0;i<n;i++) printf("%d %d\n",i,d[i]);
}

int main()
{
    //freopen("data.txt","r",stdin);
    cin >> n;
    G.resize(n,vector<int>(n,INT_MAX));
    d.resize(n,INT_MAX);
    p.resize(n,-1);
    colors.resize(n,WHITE);
    for(int i =0;i<n;i++){
        int u,k;
        cin >>u>>k;
        for(int j=0;j<k;j++){
            int v,c;
            cin >> v >>c;
            G[u][v] = c;
        }
    }
    sssp(0);
    //printf("YES\n");
    return 0;
}

C++: #include<iostream>
using namespace std;
#define MAX 108
#define black 2
#define gray 1
#define white 0
#define INFTY 1<<21
int mark[MAX][MAX];
int color[MAX];
int d[MAX];
int p[MAX];
int n;
inline void display(){
	cout<<endl;
	for(int i = 0;i<n;++i){
		for(int j = 0;j<n;++j)
			cout<<mark[i][j]<<' ';
	cout<<endl;
	}
	cout<<endl;
} 
void dijkstra( int begin ){
	for(int i = 0;i<n;++i){
		d[i] = INFTY;
		p[i] = -1;
		color[i] = white;
	}
	int mincost,u;
	d[0] = 0;
	
	while( true ){
		mincost = INFTY;
		for(int i= 0;i<n;++i)
			if(black!=color[i]&&d[i]<mincost){
				u = i;
				mincost = d[i];
			}
		if(INFTY==mincost)break;
		color[u] = black;
		for(int i =0;i<n;++i)
			if(black!=color[i]&&mark[u][i]!=-1&&d[i]>mincost+mark[u][i]){
				d[i] = mincost+mark[u][i];
				p[i] = u;
				color[i] = gray;
			}
	}
	for(int i = 0;i<n;++i)
		cout<<i<<' '<<d[i]<<endl;
} 

int main(){
	int u,k,vx,c;
	cin>>n;
	for(int i = 0;i<n;++i)
		for(int j=0;j<n;++j)
			mark[i][j] = -1;
	for(int i =0;i<n;++i){
		cin>>u>>k;
		for(int j = 0;j<k;++j){
			cin>>vx>>c;
			mark[u][vx] = c;
		}
	}
	
//	display();
	dijkstra(0);
	return 0;
}
/*
5
0 3 2 3 3 1 1 2
1 2 0 2 3 4
2 3 0 3 3 1 4 1
3 4 2 1 0 1 1 4 4 3
4 2 2 1 3 3


*/

C++: #include<iostream>
using namespace std;
static const int MAX =100;
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];

int prim(){
  int u,minv;
  int d[MAX],p[MAX],color[MAX];

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

  while(1){
    minv=INFTY;
    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(color[v]!=BLACK&& M[u][v]!=INFTY){
      if(d[v]>M[u][v]){
      d[v]=M[u][v];
      p[v]=u;
      color[v]=GRAY;
      }
    }
  }
  }
  int sum=0;
  for(int i=0;i<n;i++){
    if(p[i]!=-1) sum+=M[i][p[i]];
  }
  return sum;
}

int main(){
  cin >>n;

  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      int e; cin >>e;
      M[i][j] =(e==-1) ? INFTY : e;
    }
  }

  cout << prim() << endl;

  return 0;
}