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]
					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 <iostream>
#include <queue>
using namespace std;
struct Line{
        int a;
        int b;
        int cost;
        int time;
};
int Min(int x,int y){
        return x<y?x:y;
}
#define Max 2000000000
int main(){
        int N,M;
        while(true){
                Line lines[3000];
                cin >> N >>M;
                if(N+M==0)      break;
                for(int i=0 ; i<N ; i++ ){
                        cin >> lines[i].a >> lines[i].b ;
                        cin >> lines[i].cost >> lines[i].time;
                }
                int K;
                cin >> K;
                for(int i=0 ; i<K ; i++ ){
                        int to,from,r;
                        cin >> from >> to>>r;
                        queue <int> circle;
                        circle.push(from);
                        int dp[3000];
                        for(int i=0 ; i<=M ; i++ )
                                dp[i]=Max;
                        dp[from]=0;
                        while(circle.size()!=0){
                                int now=circle.front();
                                for(int i=0 ; i<N ; i++ ){
                                        if(now==lines[i].a){
                                                int next=lines[i].b;
                                                if(!r)
                                                        dp[next]=Min(dp[next],dp[now]+lines[i].cost);
                                                else
                                                        dp[next]=Min(dp[next],dp[now]+lines[i].time);
                                                circle.push(lines[i].b);
                                        }
                                }
                                circle.pop();
                        }
                        cout << dp[to] << endl;
                }
        }
        return 0;
}

C++: // 2014/06/16 Tazoe

#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 k=0;k<n;k++){
      for(int j=0;j<n;j++){
        for(int i=0;i<n;i++){
          if(C[i][j] > C[i][k]+C[k][j])
            C[i][j] = C[i][k] + C[k][j];
          if(T[i][j] > T[i][k]+T[k][j])
            T[i][j] = T[i][k] + T[k][j];
        }
      }
    }
    unsigned int k;
    cin >> k;
    for(int i=0;i<k;i++){
      int p,q,r;
      cin >> p >> q;
      if(k == 0  &&  q == 0)
        return 0;
      cin >> r;

      if(r==0){
        cout << C[p][q] << endl;
      } else {
        cout << T[p][q] << endl;
      }
    }
    break;
	}

	return 0;
}

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

#define V_MAX 100
using namespace std;

struct edge { 
    int to, cost; 
    edge(int to, int cost) : to(to), cost(cost){} 
};

vector<edge> money_g[V_MAX];
vector<edge> time_g[V_MAX];

int money_d[V_MAX], time_d[V_MAX];

#define INF 1000000

typedef pair<int, int> P; // cost, to
int min_money_cost(int from, int to) {
    priority_queue<P, vector<P>, greater<P> > q;
    fill(money_d, money_d+V_MAX, INF);
    money_d[from] = 0;
    q.push(P(0, from));

    while (!q.empty()) {
        P p = q.top(); q.pop();
        int v = p.second;
        if (money_d[v] < p.first) continue;
        for (int i = 0; i < money_g[v].size(); i++) {
            edge e = money_g[v][i];
            if (money_d[e.to] > money_d[v] + e.cost) {
                money_d[e.to] = money_d[v] + e.cost;
                q.push(P(money_d[e.to], e.to));
            }
        }
    }

    return money_d[to];
}

int min_time_cost(int from, int to) {
    priority_queue<P, vector<P>, greater<P> > q;
    fill(time_d, time_d+V_MAX, INF);
    time_d[from] = 0;
    q.push(P(0, from));

    while (!q.empty()) {
        P p = q.top(); q.pop();
        int v = p.second;
        if (time_d[v] < p.first) continue;
        for (int i = 0; i < time_g[v].size(); i++) {
            edge e = time_g[v][i];
            if (time_d[e.to] > time_d[v] + e.cost) {
                time_d[e.to] = time_d[v] + e.cost;
                q.push(P(time_d[e.to], e.to));
            }
        }
    }

    return time_d[to];
}

int main() {
    int n, m;
    while (cin >> n >> m, (n || m)) {
        for (int i = 0; i < n; i++) {
            int a, b, money, time;
            cin >> a >> b >> money >> time;
            money_g[a].push_back(edge(b, money));
            money_g[b].push_back(edge(a, money));
            time_g[a].push_back(edge(b, time));
            time_g[b].push_back(edge(a, time));
        }
        int k; cin >> k;
        for (int i = 0; i < k; i++) {
            int from, to, query_t;
            cin >> from >> to >> query_t;
            int res;
            if (query_t == 0) res = min_money_cost(from, to);
            else res = min_time_cost(from, to);
            cout << res << endl;
        }
    }
    return 0;
}