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 <stdio.h>
#include <limits.h>

const int INF = INT_MAX;

int main(void)
{
	int n, m, a, b, k, t;
	int tcost[105][105], mcost[105][105], node[105], used[105];
	int i, j, min, no1, no2;
	
	while (1){
		scanf("%d %d", &n, &m);
		
		if (n == 0 && m == 0){
			break;
		}
		
		for (i = 0; i < m; i++){
			for (j = 0; j < m; j++){
				mcost[i][j] = INF;
				tcost[i][j] = INF;
			}
		}
		
		for (i = 0; i < n; i++){
			scanf("%d %d", &a, &b);
			a--; b--;
			scanf("%d %d", &no1, &no2);
			
			if (no1 < mcost[a][b]){
				mcost[a][b] = no1;
				mcost[b][a] = no1;
			}
			if (no2 < mcost[a][b]){
				tcost[a][b] = no2;
				tcost[b][a] = no2;
			}
			
		}
		
		scanf("%d", &k);
		
		for (i = 0; i < k; i++){
			scanf("%d %d %d", &a, &b, &t);
			a--; b--;
			for (j = 0; j < m; j++){
				node[j] = INF;
				used[j] = 0;
			}
			
			node[a] = 0;
			while (1){
				used[a] = 1;
				min = INF;
				
				for (j = 0; j < m; j++){
					if (t == 1){
						if (used[j] == 0 && tcost[a][j] != INF && node[j] > node[a] + tcost[a][j]){
							node[j] = node[a] + tcost[a][j];
						}
						if (used[j] == 0 && min > node[j]){
							min = j;
						}
					}
					else{
						if (used[j] == 0 && tcost[a][j] != INF && node[j] > node[a] + mcost[a][j]){
							node[j] = node[a] + mcost[a][j];
						}
						if (used[j] == 0 && min > node[j]){
							min = j;
						}
					}
				}
				a = min;
				if (a == b){
					break;
				}
			}
			printf("%d\n", node[b]);
		}
	}
	return (0);
}

C++: #include<iostream>
using namespace std;
const int INF = 1000000000;
int main()
{
	while(true){
		int n, m;
		cin >> n >> m;

		if(n==0 && m==0)
			break;

		int C[100][100];
		int T[100][100];
		for(int i=0; i<m; i++){
			for(int j=0; j<m; j++){
				if(i==j){
					C[i][j] = T[i][j] = 0;
				}
				else{
					C[i][j] = T[i][j] = INF;
				}
			}
		}
		for(int i=0; i<n; i++){
			int a, b, c, t;
			cin >> a >> b >> c >> t;

			C[a-1][b-1] = C[b-1][a-1] = c;
			T[a-1][b-1] = T[b-1][a-1] = t;
		}

        int Cd[100][100]; // 最短距離
        int Td[100][100]; // 最短距離
        for(int i=0; i<m; i++){ // 重み配列で初期化
            for(int j=0; j<m; j++){
                Cd[i][j]=C[i][j];
                Td[i][j]=T[i][j];
            }
        }
        for(int k=0; k<m; k++){
            for(int i=0; i<m; i++){
                for(int j=0; j<m; j++){
                    if(Cd[i][j]>(Cd[i][k]+Cd[k][j])){
                        Cd[i][j] = (Cd[i][k]+Cd[k][j]);
                    }
                    if(Td[i][j]>(Td[i][k]+Td[k][j])){
                        Td[i][j] = (Td[i][k]+Td[k][j]);
                    }
                }
            }
        }
        int K;
        cin >> K;
        for(int i=0;i<K;i++){
            int p, q;
            cin >> p >> q;
            int r;
            cin >> r;
            if(r==1){
                cout<<Td[p-1][q-1]<<endl;
            }else{
                cout<<Cd[p-1][q-1]<<endl;
            }
        }
	}
	return 0;
}

C++: #include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>

#define MAX_M 100
#define INF 1145141919

class edge{
public:
    int to;
    int cost;
    int time;
};

typedef std::pair<int, int> P;

int n, m, a, b, c, t, k, s, g, r;
int value[2][MAX_M + 1];
std::vector<edge> G[MAX_M + 1];


int ret(edge e){
    if(r == 0) return e.cost;
    return e.time;
}

void dij(){
    std::fill(value[r], value[r] + MAX_M + 1, INF);
    value[r][s] = 0;

    std::priority_queue<P, std::vector<P>, std::greater<P>> que;
    que.push(P(0, s));

    while(!que.empty()){
        P p = que.top(); que.pop();
        if(value[r][p.second] < p.first) continue;

        for(int i = 0; i < G[p.second].size(); i++){
            edge e = G[p.second][i];
            int u = ret(e);
            if(value[r][e.to] > value[r][p.second] + u){
                value[r][e.to] = value[r][p.second] + u;
                que.push(P(value[r][e.to], e.to));
            }
        }
    }

    printf("%d\n", value[r][g]);
}

int main(){

    while(scanf("%d %d", &n, &m) != EOF){
        if(n == 0 && m == 0) break;

        for(int i = 0; i < n; i++){
            scanf("%d %d %d %d", &a, &b, &c, &t);
            a--; b--;


            edge e1, e2;
            e1.to   = b; e2.to = a;
            e1.cost = c; e2.cost = c;
            e1.time = t; e2.time = t;
            G[a].push_back(e1);
            G[b].push_back(e2);
        }


        scanf("%d", &k);
        for(int i = 0; i < k; i++){
            scanf("%d %d %d", &s, &g, &r);
            s--; g--;

            dij();
        }
    }

    return 0;
}

C++: #include<iostream>

#define INF 1000000
using namespace std;

int main(){
	int data[2][110][110];
	for(int i=0;i<110;i++){
		for(int j=0;j<110;j++){
				data[1][i][j]=INF;
				data[0][i][j]=INF;
			
		}
	}	
	int n,m;
	while(cin>>n>>m && n|m){
	int a,b,cost,time;
	for(int i=0;i<n;i++){
		cin>>a>>b>>cost>>time;
		data[0][a][b]=cost;
		data[0][b][a]=cost;
		data[1][a][b]=time;
		data[1][b][a]=time;
	}

	for(int count=0;count<2;count++){
		for(int k=1;k<=m;k++){
			for(int i=1;i<=m;i++){
				for(int j=1;j<=m;j++)data[count][i][j]=min(data[count][i][j],data[count][i][k]+data[count][k][j]);
			}
		}
	}			

	int k;
	cin>>k;
	for(int i=0;i<k;i++){
		int p,q,r;
		cin>>p>>q>>r;
		cout<<data[r][p][q]<<endl;
	}
	}
}