Go: // Warshall–Floyd Algorithm

package main

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

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		c_matrix := make([][]int, m)
		for i := range c_matrix {
			c_matrix[i] = make([]int, m)
		}
		t_matrix := make([][]int, m)
		for i := range t_matrix {
			t_matrix[i] = make([]int, m)
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf_[0])
			b, _ := strconv.Atoi(buf_[1])
			c, _ := strconv.Atoi(buf_[2])
			t, _ := strconv.Atoi(buf_[3])
			c_matrix[a-1][b-1] = c
			t_matrix[a-1][b-1] = t
		}
		c_dist := make([][]int, m)
		c_prev := make([][]int, m)
		t_dist := make([][]int, m)
		t_prev := make([][]int, m)
		for i := 0; i < m; i++ {
			c_dist[i] = make([]int, m)
			c_prev[i] = make([]int, m)
			t_dist[i] = make([]int, m)
			t_prev[i] = make([]int, m)
		}
		for i := 0; i < m; i++ {
			for j := 0; j < m; j++ {
				if c_matrix[i][j] == 0{
					c_dist[i][j] = INF
				} else {
					c_dist[i][j] = c_matrix[i][j]
				}
				if c_matrix[i][j] == 0{
					c_prev[i][j] = -1
				} else {
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0{
					t_dist[i][j] = INF
				} else {
					t_dist[i][j] = t_matrix[i][j]
				}
				if t_matrix[i][j] == 0{
					t_prev[i][j] = -1
				} else {
					t_prev[i][j] = i
				}
			}
			c_dist[i][i] = 0
			t_dist[i][i] = 0
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					c_newlen := c_dist[i][k] + c_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[k][j]
					}
				}
			}
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if t_newlen < t_dist[i][j] {
						t_dist[i][j] = t_newlen
						t_prev[i][j] = t_prev[k][j]
					}

				}
			}
		}
		scanner.Scan()
		k, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < k; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			p, _ := strconv.Atoi(buf_[0])
			q, _ := strconv.Atoi(buf_[1])
			r, _ := strconv.Atoi(buf_[2])
			switch r {
			case 0: fmt.Println(c_dist[p-1][q-1])
			case 1: fmt.Println(t_dist[p-1][q-1])
			}
		}
	}
}

C++: #include<iostream>
#include<vector>
#include<cstring>
#define INF 30100
#define rep(i,n) for(int i=0;i<n;i++)
#define foreach(r,p,it) for(r::iteartor it=p.begin();it!=p.end();++it)
using namespace std;
struct E
{
    unsigned int a,b,c;
    E(){};
    E(int a, int b,int c):a(a),b(b),c(c){};
};
E cs[610];
E ts[610];

unsigned int d[110];
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        if(n==0&&m==0)break;
        
        int a,b,c,t;
        rep(i,n)
        {
            cin>>a>>b>>c>>t;
            //cs[n*2] = E(a,b,c);
            cs[i*2].a = a;cs[i*2].b = b;cs[i*2].c =c;
            cs[i*2+1].b = a;cs[i*2+1].a = b;cs[i*2+1].c =c;
            //cs[n*2+1] = E(b,a,c);
            
            ts[i*2] = E(a,b,t);
            ts[i*2+1] = E(b,a,t);

        }
        cout << "made edge " << endl;
        int p,q,r,k;
        cin >> k;
        rep(i,k)
        {
            cin >> p >> q >> r;
            memset(d,INF,sizeof(d));
            d[p] = 0;
            bool update = false;
            if(r == 0)
            {
                while(1)
                {
                    update = false;
                    rep(j,n*2)
                    {
                        if(d[ cs[j].b] != INF && d[cs[j].b] > d[cs[j].a] + cs[j].c )
                        {
                            d[cs[j].b] =  d[cs[j].a] + cs[j].c;
                            update = true;
                            //cout << j << endl;
                        }


                    }
                    if(!update) break;
                }
                cout << d[q] << endl;
            }
            else
            {
                while(1)
                {
                    update = false;
                    rep(j,n*2)
                    {
                        if(d[ ts[j].b] != INF && d[ts[j].b] > d[ts[j].a] + ts[j].c)
                        {
                            d[ts[j].b] =  d[ts[j].a] + ts[j].c;
                            update = true;
                        }
                    }
                    if(!update) break;
                }
                cout << d[q] << endl;
            }
        }
    }
    return 0;
}

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

const int MAX_V = 1000; 
const int INF = 100000; 
int v; 
int g[MAX_V][MAX_V]; 
int g2[MAX_V][MAX_V];
int d[MAX_V]; 
bool used[MAX_V]; 


void dijkstra(int s)
{
  fill(d, d + v, INF);
  fill(used, used + v, false);
  d[s] = 0;
  for(;;){
    int i = -1;
    for(int j = 0; j < v; ++j)
      if(!used[j] && (i == -1 || d[i] > d[j]))
	i = j;
    if(i == -1)break; 
    used[i] = true;
    for(int j = 0; j < v; ++j)
      d[j] = min(d[j], d[i] + g[i][j]);
  }
}

void dijkstra2(int s)
{
  fill(d, d + v, INF);
  fill(used, used + v, false);
  d[s] = 0;
  for(;;){
    int i = -1;
    for(int j = 0; j < v; ++j)
      if(!used[j] && (i == -1 || d[i] > d[j]))
	i = j;
    if(i == -1)break; 
    used[i] = true;
    for(int j = 0; j < v; ++j)
      d[j] = min(d[j], d[i] + g2[i][j]);
  }
}


int main()
{
  for(;;){
    int gv, ge;
    
    cin >> ge >> gv;
    if(ge==0){return 0;}

    fill(&g[0][0], &g[MAX_V][0], 100000);
    fill(&g2[0][0], &g2[MAX_V][0], 100000);


    for(int i = 0; i < ge; ++i){
      int gs, gt, gd,gd2;
      cin >> gs >> gt >> gd >> gd2;
      g[gs-1][gt-1]=gd;
      g[gt-1][gs-1]=gd;
      g2[gs-1][gt-1]=gd2;
      g2[gt-1][gs-1]=gd2;
    }
    v = gv;

    //for(int i=0;i<v;i++){for(int j=0;j<v;j++){cout << g[i][j] << " ";}cout << endl;}

    //for(int i=0;i<v;i++){for(int j=0;j<v;j++){cout << g2[i][j] << " ";}cout << endl;}


    
    int k;
    cin >> k;
    for(int i=0;i<k;i++){
      int p,q,r;
      cin >> p >> q >> r;
      if(r==0){
	dijkstra(p-1);
	//for(int j=1;j<=gv;j++)
	  cout << d[q-1] << endl;
      }else{
	dijkstra2(p-1);
	//for(int j=0;j<=gv;j++)
	  cout << d[q-1] << endl;
      }
    }
  }
  return 0;
}

C++: #include<iostream>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef pair<int,int> P;
typedef struct{
	int next;
	int cost;
	int tim;
}edge;

int n,m;
vector<edge> mapp[101];
int bfs_c(int now,int goal);
int bfs_t(int now,int goal);

int main(){
	while(1){
		cin >> n >> m;
		if(n == 0 && m == 0) break;
		for(int i=0;i<n+1;i++){
			mapp[i].clear();
		}
		for(int i=0;i<n;i++){
			int a,b,cost,tim;
			cin >> a >> b >> cost >> tim;
			edge x;
			x.next = b; x.cost = cost; x.tim = tim;
			mapp[a].push_back(x);
		}
		int k;
		cin >> k;
		int ans;
		for(int i=0;i<k;i++){
			int p,q,r;
			cin >> p >> q >> r;
			if(r == 0) ans = bfs_c(p,q);
			else if(r == 1) ans = bfs_t(p,q);
			cout << ans << endl;
		}
	}
}

int bfs_c(int now,int goal){
	priority_queue<P, vector<P>,greater<P> > que;
	que.push(P(now,0));
	while(!que.empty()){
		P p = que.top(); que.pop();
		int no = p.first;
		int co = p.second;
		if(no == goal) return co;
		int len=mapp[no].size();
		for(int i=0;i<len;i++){
			edge x = mapp[no][i];
			que.push(P(x.next,co+x.cost));
		}
	}
	return 0;
}

int bfs_t(int now,int goal){
	priority_queue<P, vector<P>,greater<P> > que;
	que.push(P(now,0));
	while(!que.empty()){
		P p = que.top(); que.pop();
		int no = p.first;
		int co = p.second;
		if(no == goal) return co;
		int len=mapp[no].size();
		for(int i=0;i<len;i++){
			edge x = mapp[no][i];
			que.push(P(x.next,co+x.tim));
		}
	}
	return 0;
}