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
			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 <algorithm>
#include <vector>
#include <utility>
using namespace std;

const int INF = 1<<29;

int n, m, a, b, c, t, k;
int dp[2][100][100];

int main(){
    for(; scanf("%d%d", &n, &m), n||m;){
        for(int x = 0; x < m; x++){
            fill(dp[0][x], dp[0][x]+m, INF);
            fill(dp[1][x], dp[1][x]+m, INF);
        }
        for(int x = 0; x < m; x++){
            dp[0][x][x] = dp[1][x][x] = 0;
        }
        for(int x = 0; x < n; x++){
            scanf("%d%d%d%d", &a, &b, &c, &t);
            --a; --b;
            dp[0][a][b] = c;
            dp[1][a][b] = t;
        }
        for(int z = 0; z < m; z++){
            for(int x = 0; x < m; x++){
                for(int y = 0; y < m; y++){
                    for(int w = 0; w < 2; w++){
                        dp[w][x][y] = min(dp[w][x][y],
                            dp[w][x][z] + dp[w][z][y]);
                    }
                }
            }
        }
        scanf("%d", &k);
        for(int x = 0; x < k; x++){
            scanf("%d%d%d", &a, &b, &c);
            printf("%d\n", dp[c][--a][--b]);
        }
    }
    return 0;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<s;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define int ll
using namespace std;
typedef pair<long long,long long> pii;
#define MAX 99999999
signed main(){
	int n,m;
	cin>>n>>m;
	vector<vector<pii>>v(n+1,vector<pii>(n+1,pii(INF,INF)));
	rep(i,n+1)v[i][i]=pii(INF,INF);
	rep(i,n){
		pii temp;
		int s,g;
		cin>>s>>g>>temp.first>>temp.second;
        v[--s][--g]=temp;
	}
	int k; cin>>k;
    rep(u,k){
    int s,g; int r;
    cin>>s>>g>>r;
    if(!r){
        rep(k,m){
            rep(j,m){
                rep(i,m){
                    v[i][j].first=min(v[i][k].first+v[k][j].first,v[i][j].first);
                }
            }
        }
        cout<<v[--s][--g].first<<endl;
    }else{
        rep(k,m){
            rep(j,m){
                rep(i,m){
                    v[i][j].second=min(v[i][k].second+v[k][j].second,v[i][j].second);
                }
            }
        }
        cout<<v[--s][--g].second<<endl;
    }
    }
}

C++: #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int MAX_INT = 10000;
int n, m;
int p, q, r;

int costMap[101][101];
int timeMap[101][101];
int visited[101];

class Node {
public:
	int cost, pos;
	Node(int p) {
		cost = 0;
		pos = p;
	}
	Node(int p, int c, const Node& pre) {
		cost = c + pre.cost;
		pos = p;
	}
	bool operator< (const Node& o) const {
		return cost > o.cost;
	}
};

int memo[101][101][2];

int main () {
	while (cin >> n >> m, n || m) {
		for (int i = 0; i <= m; i++) {
			fill(costMap[i], costMap[i] + m + 1, MAX_INT);
			fill(timeMap[i], timeMap[i] + m + 1, MAX_INT);
		}
		for (int i = 0; i < n; i++) {
			int a, b, cost, time;
			cin >> a >> b >> cost >> time;
			costMap[a][b] = costMap[b][a] = cost;
			timeMap[a][b] = timeMap[b][a] = time;
		}
		int k;
		for (int i = 0; i <= m; i++) {
			for (int j = 0; j <= m; j++) {
				memo[i][j][0] = 0x7fffffff;
				memo[i][j][1] = 0x7fffffff;
			}
		}
		for (cin >> k; k; k--) {
			cin >> p >> q >> r;
			if (memo[p][q][r] != 0x7fffffff) {
				cout << memo[p][q][r] << endl;
			}
			fill(visited, visited + m + 1, MAX_INT);
			priority_queue<Node> que;
			que.push(Node(p));
			visited[p] = 0;
			while (!que.empty()) {
				Node current = que.top();
				que.pop();
				if (current.pos == q) {
					cout << current.cost << endl;
					memo[p][q][r] = memo[q][p][r] = current.cost;
					break;
				}
				for (int i = 1; i <= m; i++) {
					if (r) {
						if (timeMap[current.pos][i] != MAX_INT && timeMap[current.pos][i] + current.cost < visited[i]) {
							visited[i] = timeMap[current.pos][i] + current.cost;
							que.push(Node(i, timeMap[current.pos][i], current));
							//cout << current.pos << " to " << i << endl;
						}
					}
					else {
						if (costMap[current.pos][i] != MAX_INT && costMap[current.pos][i] + current.cost < visited[i]) {
							visited[i] = costMap[current.pos][i] + current.cost;
							que.push(Node(i, costMap[current.pos][i], current));
							//cout << current.pos << " to " << i << endl;
						}
					}
				}
			}
		}
	}
	return 0;
}