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>

int dijkstra(short int,short int,short int,short int,short int**);

int main(void)
{
	short int f1, f2, n, m, a, b, ic, ti, k, p, q, r, out, **cost, **time;

	while(scanf("%d %d",&n,&m) && n > 0)
	{

		cost = new int *[m];
		time = new int *[n];
		//線路設計
		for(f1 = 0; f1 < n; f1++)
		{
			cost[f1] = new int [m];
			time[f1] = new int [m];
			for(f2 = 0; f2 < m; f2++)
			{
				cost[f1][f2] = 0;
				time[f1][f2] = 0;
			}
		}
		//線路情報入力
		for(f1 = 0; f1 < n; f1++)
		{
			scanf("%d %d %d %d",&a, &b, &ic, &ti);
			a--;
			b--;
			cost[a][b] = ic;
			cost[b][a] = ic;
			time[a][b] = ti;
			time[b][a] = ti;
		}
		//問い合わせ入力
		scanf("%d",&k);
		for(f1 = 1; f1 <= k; f1++)
		{
			scanf("%d %d %d",&p, &q, &r);
			p--;
			q--;
			if(r == 0)
				out = dijkstra(n, m, p, q, cost);
			else
				out = dijkstra(n, m, p, q, time);

			printf("%d\n",out);
		}
	}
	return 0;
}

int dijkstra(int n, int m, int p, int q, int **temp)
{
	int *C, *sum, f1, po = p, min;
	//Cの中身　0：出発していない　1：出発した
	C = new int [m];
	sum = new int [m];
	//初期化
	for(f1 = 0; f1 < m; f1++)
	{
		C[f1] = 0;
		sum[f1] = 0;
	}
	//ダイクストラ探索
	while(po != q)
	{
		//現在いる地点から次の駅までにかかるコストを計算し次に行く駅の現時点での最小コストを求める
		for(f1 = 0; f1 < m; f1++)
		{
			if(temp[po][f1] > 0)
			{
				if(C[f1] == 0 && (sum[f1] == 0 || temp[po][f1] + sum[po] < sum[f1]))
					sum[f1] = temp[po][f1] + sum[po];
			}
		}
		//出発していない駅の中で最小コストを選択する
		min = 0;
		C[po] = 1;
		for(f1 = 0; f1 < m; f1++)
		{
			if(C[f1] == 0 && sum[f1] != 0 && (min == 0 || sum[f1] < min))
			{
				min = sum[f1];
				po = f1;
			}
		}
	}
	return sum[q];
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;

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

int N,M,K;
const int MAXN=128;
const int INF=1e9;
int G1[MAXN][MAXN];
int G2[MAXN][MAXN];

int main()
{
	while(cin>>M>>N&&(M||N))
	{
		fill((int*)G1,(int*)&G1[MAXN][MAXN],INF);
		fill((int*)G2,(int*)&G2[MAXN][MAXN],INF);
		//rep(i,N){ rep(j,N){ G1[i][j]=INF; G2[i][j]=INF; } }

		rep(i,M)
		{ 
			int a,b,c,d;
			cin>>a>>b>>c>>d; --a; --b;
			G1[a][b]=G1[b][a]=c;
			G2[a][b]=G2[b][a]=d;
		}

		rep(from,N) rep(to,N) rep(point,N)
		{
			G1[from][to] = min(G1[from][to],G1[from][point]+G1[point][to]);
			G2[from][to] = min(G2[from][to],G2[from][point]+G2[point][to]);
		}

		cin>>K;
		rep(i,K)
		{
			int a,b,c; cin>>a>>b>>c; --a; --b;
			cout<<(c?G2[a][b]:G1[a][b])<<endl;
		}
	}

	return 0;
}

C++: #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
int dp[2][100][100];
void mainmain(){
	int n,m;
	while(cin>>n>>m,n||m){
		rep(i,2){
			rep(j,100){
				rep(k,100){
					dp[i][j][k]=INF;
				}
			}
		}
		rep(i,n){
			int a,b,c,d;
			cin>>a>>b>>c>>d;
			a--;
			b--;
			dp[0][a][b]=c;
			dp[0][b][a]=c;
			dp[1][a][b]=d;
			dp[1][b][a]=d;
		}
		rep(k,m){
			rep(i,m){
				rep(j,m){
					rep(l,2){
						dp[l][i][j]=min(dp[l][i][j],dp[l][i][k]+dp[l][k][j]);
					}
				}
			}
		}
		int k;
		cin>>k;
		rep(i,k){
			int p,q,r;
			cin>>p>>q>>r;
			cout<<dp[r][p-1][q-1]<<endl;
		}
	}
}



}
main() try{
    mainmain();
}
catch(...){
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;

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

int N,M,K;
const int MAXN=128;
const int INF=1e9;
int G1[MAXN][MAXN];
int G2[MAXN][MAXN];

int main()
{
	while(cin>>N>>M&&(N||M))
	{
		int a,b,c,d;

		rep(i,N){ rep(j,N){ G1[i][j]=INF; G2[i][j]=INF; } }

		rep(i,N)
		{ 
			cin>>a>>b>>c>>d; --a; --b;
			G1[a][b]=G1[b][a]=c;
			G2[a][b]=G2[b][a]=d;
		}

		rep(from,N) rep(to,N) rep(point,N)
		{
			G1[from][to] = min(G1[from][to],G1[from][point]+G1[point][to]);
			G2[from][to] = min(G2[from][to],G2[from][point]+G2[point][to]);
		}

		cin>>K;
		rep(i,K)
		{
			cin>>a>>b>>c; --a; --b;
			cout<<(c?G1[a][b]:G2[a][b])<<endl;
		}
	}

	return 0;
}