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 <stdio.h>

#define min(x, y) ((x) < (y) ? (x) : (y))

int main(void)
{
    int cost[100][100];
    int time[100][100];
    int n, m;
    int k;
    
    while (1){
        for (int i = 0; i < 100; i++){
            for (int j = 0; j < 100; j++){
                cost[i][j] = time[i][j] = 100000000;
            }
        }
        
        scanf("%d %d", &n, &m);
        
        if (n == 0){
            break;
        }
        
        for (int i = 0; i < n; i++){
            int a, b, c, t;
            
            scanf("%d%d%d%d", &a, &b, &c, &t);
            a--;
            b--;
            cost[a][b] = cost[b][a] = min(cost[a][b], c);
            time[a][b] = time[b][a] = min(time[a][b], t);
        }
        
        for (int k = 0; k < m; k++){
            for (int i = 0; i < m; i++){
                for (int j = 0; j < m; j++){
                    cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
                    time[i][j] = min(time[i][j], time[i][k] + time[k][j]);
                }
            }
        }
        
        
        scanf("%d", &k);
        for (int i = 0; i < k; i++){
            int a, b, r;
            
            
            scanf("%d%d%d", &a, &b, &r);
            
            a--;
            b--;
            
            if (r == 0){
                printf("%d\n", cost[a][b]);
            }
            else {
                printf("%d\n", time[a][b]);
            }
        }
    }
    
    return (0);
}

C++: #include <bits/stdc++.h>

using namespace std;

const int INF = 1 << 24;

struct Node {
    int dist, time;
    Node(int d, int t) : dist(d), time(t) {}
};

int main() {

    int n, m, a, b, d, t;
    int k, p, q, r;


    while(cin >> n >> m, n | m) {

        vector<vector<Node> > node(100, vector<Node>(100, Node(INF, INF)));

        for(int i = 0; i < m; ++i) {
            node[i][i].dist = 0;
            node[i][i].time = 0;
        }

        for(int i = 0; i < n; ++i) {
            cin >> a >> b >> d >> t;
            --a;
            --b;
            node[a][b].dist = d;
            node[a][b].time = t;
        }

        for(int i = 0; i < m; ++i) {
            for(int j = 0; j < m; ++j) {
                for(int k = 0; k < m; ++k) {
                    node[j][k].dist = min(node[j][k].dist, node[j][i].dist + node[i][k].dist);
                    node[j][k].time = min(node[j][k].time, node[j][i].time + node[i][k].time);
                }
            }
        }

        cin >> k;

        for(int i = 0; i < k; ++i) {
            cin >> p >> q >> r;
            --p;
            --q;
            if(r == 0) {
                cout << node[p][q].dist << endl;
            } else {
                cout << node[p][q].time << endl;
            }
        }

    }

}

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;

		}
/*
for(int i=0; i<m; i++){
for(int j=0; j<m; j++){
cout<<T[i][j]<<"     ";
}
cout <<endl;
}
for(int i=0; i<m; i++){
for(int j=0; j<m; j++){
cout<<T[i][j]<<"     ";
}
cout <<endl;
}
*/
		int minC[100][100];
		int minT[100][100];
		for(int i=0; i<m; i++){
			for(int j=0; j<m; j++){
				minC[i][j]=C[i][j];
				minT[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(minC[i][j]>minC[i][k]+minC[k][j])
						minC[i][j]=minC[i][k]+minC[k][j];

					if(minT[i][j]>minT[i][k]+minT[k][j])
						minT[i][j]=minT[i][k]+minT[k][j];
				}
			}
		}
/*		
for(int i=0; i<m; i++){
for(int j=0; j<m; j++){
cout<<minC[i][j]<<"     ";
}
cout <<endl;
}
for(int i=0; i<m; i++){
for(int j=0; j<m; j++){
cout<<minT[i][j]<<"     ";
}
cout <<endl;
}
*/
		int k;
		cin >>k;	
		for(int i=0;i<k;i++){
			int p, q, r;
			cin >> p >> q >> r;
			
			if(r==0)
				cout << minC[p-1][q-1]<<endl;
			else
				cout << minT[p-1][q-1]<<endl;

		}
	}
	return 0;	
}

C++: #include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;
const int MAX_V = 101;
int d[MAX_V][MAX_V][2];
int V;

void wrshall_floyd(){
    for (int k = 0; k < V; ++k) {
        for (int i = 0; i < V; ++i) {
            for (int j = 0; j < V; ++j) {
                d[i][j][0]=min(d[i][j][0],d[i][k][0]+d[k][j][0]);
                d[i][j][1]=min(d[i][j][1],d[i][k][1]+d[k][j][1]);
            }
        }
    }
}

int main(){
    for (int i = 0; i < MAX_V; ++i) {
        for (int j = 0; j < MAX_V; ++j) {
            if(i==j){
                d[i][j][1]=d[j][i][0]=0;
            } else {
                d[i][j][1]=d[j][i][0]=100000000;
            }
        }
    }
    int n,m;
    cin>>n>>m;
    V=n;
    for (int i = 0; i < n; ++i) {
        int a,b,c,t;
        cin>>a>>b>>c>>t;
        a--;b--;
        d[a][b][0]=d[b][a][0]=c;
        d[a][b][1]=d[b][a][1]=t;
    }
    wrshall_floyd();
    int k;cin>>k;
    for (int i = 0; i < k; ++i) {
        int t,f,r;cin>>t>>f>>r;
        t--;f--;
        cout<<d[t][f][r]<<endl;
    }
}