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

struct tEdge{
	short to, val;
	tEdge( short t, short v ){
		to = t;		val = v;
	}
};

bool operator<( const tEdge &l, const tEdge &r ){
	return ( l.val > r.val );
}

int main(){
	vector< vector<short> > cost, time;
	priority_queue< tEdge >	edges;
	vector<bool> checked;
	int n, m;
	while( cin >> n >> m, n||m ){
		cost.resize(m+1);
		time.resize(m+1);
		checked.resize(m+1);
		for( int i=1; i<=m; i++ ){
			cost[i].resize(m+1);
			time[i].resize(m+1);
			for( int j=1; j<=m; j++ ){
				cost[i][j] = time[i][j] = -1;
			}
		}
		for( int i=0; i<n; i++ ){
			int a, b, c, t;
			cin >> a >> b >> c >> t;
			cost[a][b] = cost[b][a] = c;
			time[a][b] = time[b][a] = t;
		}
		int k;
		cin >> k;
		for( int i=0; i<k; i++ ){
			int p, q, r;
			cin >> p >> q >> r;
			if( p==q ){	cout << 0 << endl;	continue;	}
			while( !edges.empty() )	edges.pop();
			for( int j=1; j<=m; j++ ){
				if( r==0 && cost[p][j]!=-1 )		edges.push( tEdge( j, cost[p][j] ) );
				else if( r==1 && time[p][j]!=-1 )	edges.push( tEdge( j, time[p][j] ) );
				checked[j] = false;
			}
			checked[p] = true;
			while(1){
				tEdge e(0,0);
				do{
					e = edges.top();
					edges.pop();
				}while( checked[e.to] );
				if( e.to == q ){
					cout << e.val << endl;
					break;
				}
				checked[e.to] = true;
				for( int x=1; x<=m; x++ ){
					if( !checked[x] ){
						if( r==0 && cost[e.to][x]!=-1 ){
							edges.push( tEdge( x, e.val+cost[e.to][x] ) );
						}else if( r==1 && time[e.to][x]!=-1 ){
							edges.push( tEdge( x, e.val+time[e.to][x] ) );
						}
					}
				}
			}
		}
	}	
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

#define REP(i,p,n) for(int i=p;i<n;++i)
#define rep(i,n) REP(i,0,n)

typedef pair<int,int> pii;
const int INF=(int)1e9, MAXN=128;
int C[2][MAXN][MAXN], cost[MAXN], N, M;

void dk(int p,int q,int r)
{
        priority_queue<pii> Q;
        Q.push(pii(0,p)); cost[p]=0;

        while(!Q.empty())
        {
                const int cc = Q.top().first, pp = Q.top().second; Q.pop();
                if(pp==q){ break; }

                rep(i,M) if(cost[pp]+C[r][pp][i]<cost[i]){ cost[i]=C[r][pp][i]+cost[pp]; Q.push(pii(INF-(cc+C[r][pp][i]),i)); }
        }
}

int main()
{
        int a,b,c,d;
        cin>>N>>M;
        rep(i,M) rep(j,N) C[0][i][j]=C[1][i][j]=INF;
        rep(i,N){ cin>>a>>b>>c>>d; --a; --b; C[0][a][b]=C[0][b][a]=c; C[1][a][b]=C[1][b][a]=d; }

        cin>>d;
        rep(i,d){ fill(cost,cost+N,INF); cin>>a>>b>>c; dk(a-1,b-1,c); cout<<cost[b-1]<<endl; }
        return 0;
}

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) return 0;
    for(i = 1; i <= m; i++){
      for(j = 1; j <= m; j++){
	money[i][j] = INF;
	time[i][j] = INF;
      }
    }
    for(i = 1; i <= m; i++){
      money[i][i] = 0;
      time[i][i] = 0;
    }
    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]);
      if(d == 0)
	printf("%d\n", money[b][c]);
    }
  }
  return 0;
}