Go: // Warshall–Floyd Algorithm

package main

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

var scanner = bufio.NewScanner(os.Stdin)

const INF = 2000000000

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
			c_matrix[b-1][a-1] = c
			t_matrix[a-1][b-1] = t
			t_matrix[b-1][a-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
					c_prev[i][j] = -1
				} else {
					c_dist[i][j] = c_matrix[i][j]
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0 {
					t_dist[i][j] = INF
					t_prev[i][j] = -1
				} else {
					t_dist[i][j] = t_matrix[i][j]
					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 <queue>
#include <algorithm>

#define V_MAX 100
using namespace std;

struct edge { 
    int to, cost; 
    edge(int to, int cost) : to(to), cost(cost){} 
};

vector<edge> money_g[V_MAX];
vector<edge> time_g[V_MAX];

int money_d[V_MAX], time_d[V_MAX];

#define INF 1000000

typedef pair<int, int> P; // cost, to
int min_money_cost(int from, int to) {
    priority_queue<P, vector<P>, greater<P> > q;
    fill(money_d, money_d+V_MAX, INF);
    money_d[from] = 0;
    q.push(P(0, from));

    while (!q.empty()) {
        P p = q.top(); q.pop();
        int v = p.second;
        if (money_d[v] < p.first) continue;
        for (int i = 0; i < money_g[v].size(); i++) {
            edge e = money_g[v][i];
            if (money_d[e.to] > money_d[v] + e.cost) {
                money_d[e.to] = money_d[v] + e.cost;
                q.push(P(money_d[e.to], e.to));
            }
        }
    }

    return money_d[to];
}

int min_time_cost(int from, int to) {
    priority_queue<P, vector<P>, greater<P> > q;
    fill(time_d, time_d+V_MAX, INF);
    time_d[from] = 0;
    q.push(P(0, from));

    while (!q.empty()) {
        P p = q.top(); q.pop();
        int v = p.second;
        if (time_d[v] < p.first) continue;
        for (int i = 0; i < time_g[v].size(); i++) {
            edge e = time_g[v][i];
            if (time_d[e.to] > time_d[v] + e.cost) {
                time_d[e.to] = time_d[v] + e.cost;
                q.push(P(time_d[e.to], e.to));
            }
        }
    }

    return time_d[to];
}

void init() {
    for (int i = 0; i < V_MAX; i++) {
        time_g[i].clear();
        money_g[i].clear();
    }
}

int main() {
    int n, m;
    while (cin >> n >> m, (n || m)) {
        init();
        for (int i = 0; i < n; i++) {
            int a, b, money, time;
            cin >> a >> b >> money >> time;
            money_g[a].push_back(edge(b, money));
            money_g[b].push_back(edge(a, money));
            time_g[a].push_back(edge(b, time));
            time_g[b].push_back(edge(a, time));
        }
        int k; cin >> k;
        for (int i = 0; i < k; i++) {
            int from, to, query_t;
            cin >> from >> to >> query_t;
            int res;
            if (query_t == 0) res = min_money_cost(from, to);
            else res = min_time_cost(from, to);
            cout << res << endl;
        }
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define INF 1010001000
#define loop(i, n) for (int i = 1; i < n; i++)

int main()
{
int n, m; cin >> n >> m; m++;
vector<vector<int> > time(m,vector<int>(m,INF)), cost(m,vector<int>(m,INF));
loop(i, n+1){
int a,b,c,t; cin>>a>>b>>c>>t;
time[a][b]=t;time[b][a]=t;
cost[a][b]=c;cost[b][a]=c;
}
loop(k, m){loop(i, m){loop(i, m){
time[i][j]=min(time[i][j],time[i][k]+time[k][j]);
cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);
}}}
int k; cin>>k;
loop(i, k+1){
int p,q,r; cin>>p>>q>>r;
if(r) cout<<time[p][q]<<endl;
else cout<<cost[p][q]<<endl;
}
return 0;

}

C++: #include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>

using namespace std;

#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define rep(i,n) for(int i=0;i<(n);i++)
#define tr(it,container) for(typeof(container.begin()) it = container.begin(); \
                             it != container.end(); ++it)
#define mp(a,b) make_pair((a),(b))
#define eq ==

typedef long long ll;
typedef complex<double> point;
typedef pair<int,int> pii;

// →↑←↓
const int dx[] = {1,0,-1,0};
const int dy[] = {0,-1,0,1};


const double EPS = 1e-9;

struct Edge{
    int from,to,cost,time;
    Edge(int from,int to,int cost,int time)
        : from(from),to(to),cost(cost),time(time) {};
};

int main(){
    while(true){
        int n,m;
        cin >> n >> m;
        if(n == 0 and m == 0) break;
        vector<vector<Edge> > V(m);

        for(int i=0;i<n;i++){
            int a,b,cost,time;
            cin >> a >> b >> cost >> time;
            a--;b--;
            V[a].push_back(Edge(a,b,cost,time));
            V[b].push_back(Edge(b,a,cost,time));
        }
        int k;
        cin >> k;
        for(int i=0;i<k;i++){
            int p,q,r;
            cin >> p >> q >> r;
            p--,q--;
            vector<char> visited(m,false);
            //                 cost,where
            priority_queue<pair<int,int> ,vector<pair<int,int> >, greater<pair<int,int> > > Q;
            Q.push(make_pair(0,p));
            while(!Q.empty()){
                int cost,where;
                cost = Q.top().first;
                where = Q.top().second;
                Q.pop();
                if(visited[where]) continue;
                if(where == q){
                    cout << cost << endl;
                    break;
                }
                visited[where] = true;
                for(int j=0;j<(int)V[where].size();j++){
                    if(r == 0){
                        Q.push(make_pair(V[where][j].cost+cost,V[where][j].to));
                    }else{
                        Q.push(make_pair(V[where][j].time+cost,V[where][j].to));
                    }
                }
            }
        }
    }
    return 0;
}