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>
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;
	}
      int k;
      int p, q, r;
      cin >> k;
      for (int i=0;i<k;i++){
	  cin >> p >> q >> r;
	  int A[m][m];
	  if(r==0){
	      for(int j=0;j<m;j++)
		for(int k=0;k<m;k++)
		  A[j][k]=C[j][k];
	      for(int j=0;j<m;j++)
		for(int k=0;k<m;k++)
		  for(int l=0;l<m;l++)
		    if(A[j][k]>A[j][l]+A[l][k])
		      A[j][k]=A[j][l]+A[l][k];
	      cout << A[p-1][q-1] << endl;
	    }
	  else{
	      for(int j=0;j<m;j++)
		for(int k=0;k<m;k++)
		  A[j][k]=T[j][k];
	      for(int j=0;j<m;j++)
		for(int k=0;k<m;k++)
		  for(int l=0;l<m;l++)
		    if(A[j][k]>A[j][l]+A[l][k])
		      A[j][k]=A[j][l]+A[l][k];
	      cout << A[p-1][q-1] << endl;
	    }
	}
    }

  return 0;
}

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

const int INF = 1<<25;

using namespace std;

int main()
{
	int n,m,i,j;
	int cost[101][101],time[101][101];
	
	for(;;)
	{
		cin >> n >> m ;
		if(n==0 && m==0)
			break;
		
		for(i=0;i<m;i++)
		{
			for(j=0;j<m+1;j++)
			{
				cost[i][j]=INF;
				time[i][j]=INF;
			}
		}
		
		for(i=0;i<n;i++)
		{
			int a,b,co,ti;
			cin >> a >> b >> co >> ti ;
			cost[a][b]=cost[b][a]=co;
			time[a][b]=time[b][a]=ti;
		}
		
		int inp;
		cin >> inp ;
		
		for(int k=0;k<m+1;k++)
		{
			for(i=0;i<m+1;i++)
			{
				for(j=0;j<m+1;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]);
				}
			}
		}
		
		for(i=0;i<inp;i++)
		{
			int st,en,se;
			cin >> st >> en >> se ;
			
			if(se==0)
				cout << cost[st][en] << endl;
			else
				cout << time[st][en] << endl;
		}
	}
}

C++: #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<map>
#define INF 1000000
using namespace std;
void cWarshall_Floyd();
void tWarshall_Floyd();
int glid_cost[101][101];
int glid_tim[101][101];
int n,m,a,b,tim,cost,qs,p,q,r;
void cWarshall_Floyd()
{
	int i,j,k;
	for(k=0;k<m;k++) {
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_cost[i][j]=min(glid_cost[i][j],glid_cost[i][k]+glid_cost[k][j]);
			}
		}
	}
}
void tWarshall_Floyd()
{
	int i,j,k;
	for(k=0;k<m;k++) {
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_tim[i][j]=min(glid_tim[i][j],glid_tim[i][k]+glid_tim[k][j]);
			}
		}
	}
}
int main(void)
{
	ios::sync_with_stdio(false);
	int i,j,k;
	while(1) {
		cin>>n>>m;
		if(n==0&&m==0) break;
		for(i=0;i<n;i++) {
			for(j=0;j<n;j++) {
				glid_cost[i][j]=INF;
				glid_tim[i][j]=INF;
			}
		}
		for(i=0;i<n;i++) {
			glid_cost[i][i]=0;
			glid_tim[i][j]=0;
		}
		for(i=0;i<n;i++) {
			cin>>a>>b>>cost>>tim;
			a--;b--;
			glid_cost[a][b]=cost;
			glid_cost[b][a]=cost;
			glid_tim[a][b]=tim;
			glid_tim[b][a]=tim;
		}
		cin>>qs;
		for(i=0;i<qs;i++) {
			cin>>p>>q>>r;
			if(r==0) {
				cWarshall_Floyd();
				cout<<glid_cost[p-1][q-1]<<endl;
			}
			else {
				tWarshall_Floyd();
				cout<<glid_tim[p-1][q-1]<<endl;
			}
		}
	}
	return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back


#define INF 999999999
int n,m;
int cost[200][200];
int tim[200][200];

int main(){
    while(cin>>n>>m){
        rep(i,200)rep(j,200) {
            cost[i][j]=INF;
            tim[i][j]=INF;
        }
        if(n==0&&m==0)break;
        rep(i,n){
            int a,b,c,d;
            cin>>a>>b>>c>>d;
            a--,b--;
            cost[a][b] = cost[b][a] = c;
            tim[a][b] = tim[b][a] = d;
        }
        rep(l,m){
            rep(i,m){
                rep(j,m){
                    cost[i][j] = min(cost[i][j],cost[i][l]+cost[l][j]);
                    tim[i][j]  = min(tim[i][j] ,tim[i][l] +tim[l][j] );
                }
            }
        }
        int k;
        cin>>k;
        rep(i,k){
            int a,b,c;
            cin>>a>>b>>c;
            a--,b--;
            if(c==0){
                cout<<cost[a][b]<<endl;
            }
            else cout<<tim[a][b]<<endl;
        }
    }
}