Go: // Warshall–Floyd Algorithm

package main

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

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
					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 <cstdio>
#include <map>

using namespace std;

typedef pair<int, int> pii;

int c[101][101] = { { 0 } };
int t[101][101] = { { 0 } };
int n, m;

int calculate(int mat[101][101], int from, int to){
	multimap<int, int> locations;
	for(int i = 1; i <= m; i++){
		if(mat[from][i] != 0){
			locations.insert(pii(mat[from][i], i));
		}
	}
	while(!locations.empty()){
		multimap<int, int>::iterator it = locations.begin();
		int d = (*it).first, f = (*it).second;
		if(f == to){ break; }
		for(int i = 1; i <= m; i++){
			if(mat[f][i] != 0 && (d + mat[f][i] < mat[from][i] || mat[from][i] == 0)){
				int dist = d + mat[f][i];
				mat[from][i] = mat[i][from] = dist;
				locations.insert(pii(dist, i));
			}
		}
		locations.erase(it);
	}
	return mat[from][to];
}

int main(){
	while(true){
		scanf("%d%d", &n, &m);
		if(n == 0 || m == 0){ break; }
		for(int i = 0; i <= m; i++){
			for(int j = 0; j <= m; j++){
				c[i][j] = t[i][j] = 0;
			}
		}
		for(int i = 0; i < n; i++){
			int a, b, cost, time;
			scanf("%d%d%d%d", &a, &b, &cost, &time);
			if(c[a][b] == 0 || c[a][b] > cost){ c[a][b] = c[b][a] = cost; }
			if(t[a][b] == 0 || t[a][b] > time){ t[a][b] = t[b][a] = time; }
		}
		int k;
		scanf("%d", &k);
		while(k--){
			int p, q, r;
			scanf("%d%d%d", &p, &q, &r);
			printf("%d\n", calculate((r == 0) ? c : t, p, q));
		}
	}
	return 0;
}

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

#define INF 10000000

// 0: cost , 1 :time
int d[2][101][101];


int main() {
    int n, m, a, b, cost, time, k, p, q, r, i, j;

    while ((cin >> n >> m) && n) {
        for (i = 1; i <= m; i++) {
            for (j = 1; j <= m; j++) {
                d[0][i][j] = d[1][j][i] = INF;
            }
        }
        for (i = 0; i < n; i++) {
            cin >> a >> b >> cost >> time;
            d[0][a][b] = d[0][b][a] = cost;
            d[1][a][b] = d[1][b][a] = time;
        }

        for (k = 1; k <= m; k++) {
            for (i = 1; i <= m; i++) {
                for (j = 1; j <= m; j++) {
                    for (r = 0; r < 2; r++) {
                        if (d[r][i][j] > d[r][i][k] + d[r][k][j]) {
                            d[r][j][i] = d[r][i][j] = d[r][i][k] + d[r][k][j];
                        }
                    }
                }
            }
        }

        cin >> k;
        while (k--) {
            cin >> p >> q >> r;
            cout << d[r][p][q] << endl;
        }
    }
    
    return 0;
}

C++: #include <iostream>
#include <queue>
using namespace std;

const int INF = 20000000;
const int MAX_M = 100;

struct data{
	int cost;
	int time;
};

int main(){
	data ds[MAX_M+1][MAX_M+1];
	int n, m, k;
	int a, b, time, cost;
	int p, q, r;
	while(cin >> n >> m){
		if(n == 0 && m == 0) break;
		for(int i = 1; i <= m; i++){
			for(int j = 1; j <= m; j++){
				ds[i][j].cost = ds[i][j].time = INF;
			}
		}
		for(int i = 0; i < n; i++){
			cin >> a >> b >> cost >> time;
			ds[a][b].cost = ds[b][a].cost = cost;
			ds[a][b].time = ds[b][a].time = time;
		}
		for(int i = 1; i <= m; i++){
			for(int j = 1; j <= m; j++){
				if(ds[j][i].cost != INF)
					for(int k = 1; k <= m; k++){
						if(ds[j][k].cost > ds[j][i].cost + ds[i][k].cost)
							ds[j][k].cost = ds[j][i].cost + ds[i][k].cost;
					}
				if(ds[j][i].time != INF)
					for(int k = 1; k <= m; k++){
						if(ds[j][k].time > ds[j][i].time + ds[i][k].time)
							ds[j][k].time = ds[j][i].time + ds[i][k].time;
					}
			}
		}
		cin >> k;
		for(int i = 0; i < k; i++){
			cin >> p >> q >> r;
			if(r) cout << ds[p][q].time << endl;
			else cout << ds[p][q].cost << endl;;
		}
	}
	return 0;
}