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++: //AOJ 0200
//菴ソ縺?婿繧ゅｏ縺九ｉ縺ェ縺?¥縺帙↓include縺励∪縺上ｋ莠コ髢薙?繧ッ繧コ
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<list>
#include<deque>
using namespace std;
#define INF 1 << 30
#define MAX_B 101

int a, b, i, j, k, money[MAX_B][MAX_B], time[MAX_B][MAX_B], n, m, c, d;
bool judge;
stack<int> left, right;


int main(){
  while(1){
    scanf("%d %d", &n, &m);
    if(n == 0 && m == 0) break;
    for(i = 1; i <= m; i++){
      for(j = 1; j <= m; j++){
	if(i == j){
	  money[i][j] = 0;
	  time[i][j] = 0;
	  continue;
	}
	money[i][j] = INF;
	time[i][j] = INF;
      }
    }
    for(i = 0; i < n; i++){
      scanf("%d %d %d %d", &a, &b, &c, &d);
      money[a][b] = c;
      money[b][a] = c;
      time[a][b] = d;
      time[b][a] = d;
    }
    for(i = 1; i <= m; i++){
      for(j = 1; j <= m; j++){
	for(k = 1; k <= m; k++){
	  if(money[j][k] > money[j][i] + money[i][k]){
	    money[j][k] = money[j][i] + money[i][k];
	    money[k][j] = money[j][i] + money[i][k];
	  }
	  if(time[j][k] > time[j][i] + time[i][k]){
	    time[j][k] = time[j][i] + time[i][k];
	    time[k][j] = time[j][i] + time[i][k];
	  }
	}
      }
    }
    scanf("%d", &a);
    for(i = 0; i < a; i++){
      scanf("%d %d %d", &b, &c, &d);
      if(d == 1) printf("%d\n", time[b][c]);
      else printf("%d\n", money[b][c]);
    }
  }
  return 0;
}

C++: #include<stdio.h>

short int dijkstra(short int,short int,short int,short int,short int**);

int main(void)
{
	short int f1, f2, n, m, a, b, ic, ti, k, p, q, r, out, **cost, **time;

	while(scanf("%d %d",&n,&m) && n > 0)
	{

		cost = new short int *[m];
		time = new short int *[n];
		//線路設計
		for(f1 = 0; f1 < n; f1++)
		{
			cost[f1] = new short int [m];
			time[f1] = new short int [m];
			for(f2 = 0; f2 < m; f2++)
			{
				cost[f1][f2] = 0;
				time[f1][f2] = 0;
			}
		}
		//線路情報入力
		for(f1 = 0; f1 < n; f1++)
		{
			scanf("%d %d %d %d",&a, &b, &ic, &ti);
			a--;
			b--;
			cost[a][b] = ic;
			cost[b][a] = ic;
			time[a][b] = ti;
			time[b][a] = ti;
		}
		//問い合わせ入力
		scanf("%d",&k);
		for(f1 = 1; f1 <= k; f1++)
		{
			scanf("%d %d %d",&p, &q, &r);
			p--;
			q--;
			if(r == 0)
				out = dijkstra(n, m, p, q, cost);
			else
				out = dijkstra(n, m, p, q, time);

			printf("%d\n",out);
		}
	}
	return 0;
}

short int dijkstra(short int n,short int m,short int p,short int q,short int **temp)
{
	short int *C, *sum, f1, po = p, min;
	//Cの中身　0：出発していない　1：出発した
	C = new int [m];
	sum = new int [m];
	//初期化
	for(f1 = 0; f1 < m; f1++)
	{
		C[f1] = 0;
		sum[f1] = 0;
	}
	//ダイクストラ探索
	while(po != q)
	{
		//現在いる地点から次の駅までにかかるコストを計算し次に行く駅の現時点での最小コストを求める
		for(f1 = 0; f1 < m; f1++)
		{
			if(temp[po][f1] > 0)
			{
				if(C[f1] == 0 && (sum[f1] == 0 || temp[po][f1] + sum[po] < sum[f1]))
					sum[f1] = temp[po][f1] + sum[po];
			}
		}
		//出発していない駅の中で最小コストを選択する
		min = 0;
		C[po] = 1;
		for(f1 = 0; f1 < m; f1++)
		{
			if(C[f1] == 0 && sum[f1] != 0 && (min == 0 || sum[f1] < min))
			{
				min = sum[f1];
				po = f1;
			}
		}
	}
	return sum[q];
}

C++: #define _CRT_SECURE_NO_WARNINGS

#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

short cost[3000][3000];
short time_data[3000][3000];


short main(){
	short n, m;


	while (cin >> n >> m && (n != 0 && m != 0)) {
		short min_ = 2000; // 答えの最小値
		short min_num = 1; // 答えの町

		short from, to, time_, cost_;
		short k;
		short k_from, k_to, info;

		for (short i = 0; i < 3000; i++) {
			for (short j = 0; j < 3000; j++) {
				cost[i][j] = 2000;
				time_data[i][j] = 2000;
			}
		}
		for (short i = 0; i < 3000; i++) {
			cost[i][i] = 0;
		}
		for (short i = 0; i < n; i++) {
			cin >> from >> to >> cost_ >> time_;
			cost[from][to] = cost_;
			cost[to][from] = cost_;
			time_data[from][to] = time_;
			time_data[to][from] = time_;
		}
		for (short k = 1; k <= m; k++) {
			for (short i = 1; i <= m; i++) {
				for (short j = 1; j <= m; j++) {
					cost[i][j] = min((int)cost[i][j], cost[i][k] + cost[k][j]);

					time_data[i][j] = min((int)time_data[i][j], time_data[i][k] + time_data[k][j]);
				}
			}
		}
		// 答えを求める
		cin >> k;
		for (short i = 0; i < k; i++) {
			cin >> k_from >> k_to >> info;
			if (info == 0) {
				cout << cost[k_from][k_to] << endl;
			} else {
				cout << time_data[k_from][k_to] << endl;
			}
		}
		
  }
	return 0;
}