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]
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[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>
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
using namespace std;
const int INF = 999999999;
int main(){
	int m, n, a, b, p, q, k, r;
	while(cin >> n >> m, (m||n)) {
		int c[110][110], t[110][110];
		rep(i,110) {
			rep(j,110) {
				c[i][j] = INF;
				t[i][j] = INF;
			}
		}
		rep(i,n) {
			cin >> a >> b >> p >> q;
			a--, b--;
			c[a][b] = c[b][a] = p;
			t[a][b] = t[b][a] = q;
		}
		rep(i,m) {
			rep(j,m) {
				rep(k,m) {
					c[j][k] = min(c[j][k], c[j][i]+c[i][k]);
					t[j][k] = min(t[j][k], t[j][i]+t[i][k]);
				}
			}
		}
		cin >> k;
		rep(i,k) {
			cin >> p >> q >> r;
			p--,q--;
			if(r==0) {
				cout << c[p][q] << endl;
			} else {
				cout << t[p][q] << endl;
			}
		}
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
const int INF = 1000000;

int map[101][101][2];//a, b, cost, time;
int d[101];//始点からの最短距離
bool used[101];//使われたかのフラグ
int V;//頂点数

int dijkstra(int start, int end, bool flag){
	std::fill(d, d + V + 1, INF);
	std::fill(used, used + V + 1, false);
	d[start] = 0;

	while(1){
		int v = -1;
		for(int u=1;u<=V;u++){
			if(!used[u] && (v == -1 || d[u] < d[v]))v = u;
		}
		
		if(v == -1)break;
		
		used[v] = true;

		for(int u=1;u<=V;u++){
			d[u] = std::min(d[u], d[v] + map[v][u][flag]);
		}
	}

	return d[end];
}

int main(){
	int n, m;//track, station
	std::cin >> n >> m;
	V = m;

	for(int i=0;i<101;i++){
		for(int j=0;j<101;j++){
			map[i][j][0] = (map[i][j][1] = INF);
		}
	}

	for(int i=0;i<n;i++){
		int a, b, cost, time;
		std::cin >> a >> b >> cost >> time;
		map[a][b][0] = cost;
		map[a][b][1] = time;
	}

	int k;//取り合わせ数
	std::cin >> k;
	while(k--){
		int p, q, r;
		std::cin >> p >> q >> r;//start, end, bool
		std::cout << dijkstra(p, q, r) << '\n';
	}
}

C++: #include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int INF = 1 << 24;
int c[200][200];
int t[200][200];
int cost[200][200];
int tim[200][200];

int main(){
  int n, m, K;
  int p, q, r;
  while(cin >> n >> m && (n || m)){
    fill(&cost[0][0], &cost[199][199] + 1, INF);
    fill(&tim[0][0], &tim[199][199] + 1, INF);
    for(int i = 1; i <= m; i++){
      cost[i][i] = tim[i][i] = 0;
      c[i][i] = t[i][i] = 0;
    }

    for(int i = 0; i < n; i++){
      int a, b;
      int d, e;
      cin >> a >> b;
      cin >> d >> e;
      cost[b][a] = min(cost[b][a], d);
      cost[a][b] = min(cost[a][b], d);

C++: #include <iostream>
#include <algorithm>
const int INF = 1000000;

int map[101][101][2];//a, b, cost, time;
int d[101];//始点からの最短距離
bool used[101];//使われたかのフラグ
int V;//頂点数

int dijkstra(int start, int end, bool flag){
	std::fill(d, d + V + 1, INF);
	std::fill(used, used + V + 1, false);
	d[start] = 0;

	while(1){
		int v = -1;
		for(int u=1;u<=V;u++){
			if(!used[u] && (v == -1 || d[u] < d[v]))v = u;
		}
		
		if(v == -1)break;
		
		used[v] = true;

		for(int u=1;u<=V;u++){
			d[u] = std::min(d[u], d[v] + map[v][u][flag]);
		}
	}

	return d[end];
}

int main(){
	int n, m;//track, station
	while(std::cin >> n >> m, n){
		V = m;

		for(int i=0;i<101;i++){
			for(int j=0;j<101;j++){
				map[i][j][0] = (map[i][j][1] = INF);
			}
		}

		for(int i=0;i<n;i++){
			int a, b, cost, time;
			std::cin >> a >> b >> cost >> time;
			map[a][b][0] = cost;
			map[a][b][1] = time;
		}

		int k;//取り合わせ数
		std::cin >> k;
		while(k--){
			int p, q, r;
			std::cin >> p >> q >> r;//start, end, bool
			std::cout << dijkstra(p, q, r) << '\n';
		}
	}
}