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

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

signed main(){
    int m,n;
    static int fare[111][111], time[111][111];
    while(cin >> m >> n && m){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                fare[i][j] = time[i][j] = (i == j) ? 0 : 1e8;
            }
        }
        for(int i = 0; i < m; i++){
            int u, v, a, b;
            cin >> u >> v >> a >> b;
            fare[u][v] = fare[v][u] = a;
            time[u][v] = time[v][u] = b;
        }
        for(int k = 1; k <= n; k++){
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= n; j++){
                    fare[i][j] = min(fare[i][j], fare[i][k] + fare[k][j]);
                    time[i][j] = min(time[i][j], time[i][k] + time[k][j]);
                }
            }
        }
        int t;
        cin >> t;
        for(int i = 0; i < t; i++){
            int u, v, q;
            cin >> u >> v >> q;
            if(q == 0) cout << fare[u][v];
            else cout << time[u][v];
            cout << endl;
        }
    }
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <cstring>
#include <functional>

using namespace std;

#define REP(i,a,b) for((i)=(a);(i)<(int)(b);(i)++)
#define rep(i,n) REP(i,0,n)
#define foreach(itr,c) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

typedef pair<int,int> P;
const int INF = 1<<29;

vector<int> dijkstra(int m, int s, vector<vector<P> >& G){
  int i;
  vector<int> d(m,INF);
  priority_queue<P,vector<P>,greater<P> > q;

  d[s] = 0;
  q.push(P(0,s));
  while(!q.empty()){
    P p = q.top(); q.pop();
    if(p.first > d[p.second]) continue;

    rep(i,G[p.second].size()){
      P pt = G[p.second][i];
      if(d[pt.first] > d[p.second] + pt.second){
        d[pt.first] = d[p.second] + pt.second;
        q.push(P(d[pt.first], pt.first));
      }
    }
  }
  return d;
}

int main(){
  int i,e,m,n;
  vector<vector<P> > times,costs;

  while(scanf("%d %d",&e,&m)){
    if(e == 0 && m == 0) break;
    times.resize(m);
    costs.resize(m);

    while(e--){
      int from, to, cost, time;
      scanf("%d %d %d %d",&from,&to,&cost,&time);
      from--; to--;
      times[from].push_back(P(to,time));
      costs[from].push_back(P(to,cost));
    }

    scanf("%d",&n);
    while(n--){
      int s,g,bit;

      scanf("%d %d %d",&s,&g,&bit);
      s--; g--;

      if(bit == 0){
        vector<int> d = dijkstra(m,s,costs);
        printf("%d\n",d[g]);
      }
      if(bit == 1){
        vector<int> d = dijkstra(m,s,times);
        printf("%d\n",d[g]);
      }
    }
  }

  return 0;
}