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>
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;
      int A[m][m];
      for(int j=0;j<m;j++)
	 for(int k=0;k<m;k++){
	    A[j][k]=T[j][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];

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

	  if(r==0){
	      cout << A[p-1][q-1] << endl;
	    }
	  else{
	      cout << A[p-1][q-1] << endl;
	    }
	}
    }

  return 0;
}

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

#define INF (1<<8)

using namespace std;

int main()
{
    int n, m;
    while(cin >> n >> m && n) {
        int times[m+1][m+1], costs[m+1][m+1];
        int a,b,cost,time;
        for(int i = 1; i <= m; i++) 
            for(int j = 1; j <= m; j++) 
                times[i][j] = costs[i][j] = (i==j) ? 0 : INF; 
        
        for(int i = 0; i < n; i++) {
            cin >> a >> b >> cost >> time;
            costs[a][b] = costs[b][a] = cost;
            times[a][b] = times[b][a] = time;
        }

        for(int c = 1; c <= m; c++) {
            for(int a = 1; a <= m; a++) {
                for(int b = 1; b <= m; b++) {
                    times[a][b] = min(times[a][b], times[a][c] + times[c][b]);
                    costs[a][b] = min(costs[a][b], costs[a][c] + costs[c][b]);
                }
            }
        }

        int p,q,r,qn;
        cin >> qn;
        for(int i = 0; i < qn; i++) {
            cin >> p >> q >> r;
            if(r == 1) cout << times[p][q] << endl;
            else       cout << costs[p][q] << endl;
        }
    }
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<climits>
using namespace std;
const int INF = INT_MAX/3;
const int MAXN = 1000;
const int TIME = 1,COST = 0;
int graph[2][MAXN][MAXN];

int n,m,a,b,c,t;
void solve();
void init(){
  for(int i = 0;i < m;i++)
    for(int j = 0;j < m;j++)
      graph[0][i][j] =graph[0][j][i] = graph[1][j][i] = graph[1][i][j] = INF;
}

int main(){
  while(1){
  cin >> n >> m;
  if(n == 0&& m == 0) break;
  init();

  for(int i = 0;i < n;i++){
    cin >> a >> b >> c >> t;
    graph[TIME][a-1][b-1] = graph[TIME][b-1][a-1] = t;
    graph[COST][a-1][b-1] = graph[COST][b-1][a-1] = c;
  }

  solve();

  int X;
  cin >> X;
  for(int i = 0;i < X;i++){
    cin >> a >> b >> c;
    cout << graph[c][a-1][b-1] << endl;
  }
  }
  return 0;
}

void solve(){
  for(int k = 0;k < m;k++){
    for(int i = 0;i < m;i++){
      for(int j = 0;j < m;j++){
	graph[0][i][j] = min(graph[0][i][j],graph[0][i][k] + graph[0][k][j]);
	graph[1][i][j] = min(graph[1][i][j],graph[1][i][k] + graph[1][k][j]);
      }
    }
  }
}

C++: #include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const ll int INF = 1e9;
int ti[101][101];//time
int co[101][101];//cost
int n,m;
int main(){
	while(1){
		cin >> n >> m; 
		if(n == 0 && m == 0) break;
		REP(i,101) REP(j,101) ti[i][j] = co[i][j] = INF;
		REP(i,101) ti[i][i] = co[i][i] = 0;

		REP(i,n){
			ll int a,b,cost,tim;
			cin >> a >> b >> cost >> tim;
			a--; b--;
			co[a][b] = co[b][a] = cost;
			ti[a][b] = ti[b][a] = tim;
		}
		//Warshall???Floyd Algorithm
		REP(i,m){
			REP(j,m){
				REP(k,m){
					ti[i][j] = min(ti[i][j], ti[i][k] + ti[k][j]);
					co[i][j] = min(co[i][j], co[i][k] + co[k][j]);
				}
			}
		}
		int k;
		cin >> k;
		REP(i,k){
			int a,b,r;
			cin >> a >> b >> r;
			a--; b--;
			if(r == 0) cout << co[a][b] << endl;
			else cout << ti[a][b] << endl;
		}
	}
	return 0;
}