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]
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[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;

int main(){
	int cost[101][101];
	int tims[101][101];
	
	while(1){
		int n,m;
		cin>>n>>m;
		if(n==0){
			break;
		}
		for(int i=0;i<101;i++){
			for(int j=0;j<101;j++){
				cost[i][j]=tims[i][j]=210000000;
			}
		}
		
		for(int i=0;i<n;i++){
			int a,b,c,d;
			cin>>a>>b>>c>>d;
			cost[a][b]=cost[b][a]=c;
			tims[a][b]=tims[b][a]=d;
		}
		
		for(int i=1;i<=m;i++){
			for(int j=1;j<=m;j++){
				for(int k=1;k<=m;k++){
					cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);
					tims[i][j]=min(tims[i][j],tims[i][k]+tims[k][j]);
				}
			}
		}
		
		int l;
		cin>>l;
		for(int i=0;i<l;i++){
			int a,b,c;
			cin>>a>>b>>c;
			if(c==0){
				printf("%d\n",cost[a][b]);
			}else{
				
				printf("%d\n",tims[a][b]);
			}
		}
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;


void Floyd_Warshall(vector< vector< int > >& graph){
  for(int k = 0; k < graph.size(); k++){
    for(int i = 0; i < graph.size(); i++){
      for(int j = 0; j < graph.size(); j++){
        graph[i][j] = min( graph[i][j], graph[i][k] + graph[k][j]);
      }
    }
  }
  return ;
}

int main() {
  int n, m;
  vector< vector< int > > graph1, graph2;

  while(cin >> n >> m, n){
    graph1.assign(m, vector< int >(m, INF));
    graph2.assign(m, vector< int >(m, INF));
    for(int i = 0; i < n; i++){
      int a, b, cost, time;
      cin >> a >> b >> cost >> time;
      --a, --b;
      graph1[a][b] = graph1[b][a] = cost;
      graph2[a][b] = graph2[b][a] = time;
    }
    Floyd_Warshall(graph1);
    Floyd_Warshall(graph2);

    int k;
    cin >> k;
    while(k--){
      int p, q, r;
      cin >> p >> q >> r;
      --p, --q;
      if(r == 0) cout << graph1[p][q] << endl;
      else cout << graph2[q][p] << endl;
    }
  }
}

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

#define INF 100000000

using namespace std;

int main()
{
    int n, m;
    while(true) {
        cin >> n >> m;
        if(n == 0 && m == 0) break;
        int times[n+1][n+1], costs[n+1][n+1];
        int a,b,cost,time;
        for(int i = 1; i <= n; i++) 
            for(int j = 1; j <= n; 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 a = 1; a <= n; a++) {
            for(int b = 1; b <= n; b++) {
                for(int c = 1; c <= n; c++) {
                    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<cstdio>
#include<queue>
using namespace std;
#define MAX 10000000
#define MAX_ST 101 //MAX_STATION
#define LP(i,n) for(int i=0;i<n;i++)
class Node{
public:
	int at;
	int cost;
	Node(int a,int c){
		at=a;cost=c;
	}
	bool operator < (const Node &o) const{
		return cost>o.cost;
	}
};
int feeMap[MAX_ST][MAX_ST];
int timeMap[MAX_ST][MAX_ST];
int minMap[MAX_ST];
bool visited[MAX_ST];
typedef priority_queue<Node> PQ;

int dijkstra(int st,int ed,int n,int judge){
	PQ pq;
	pq.push(Node(st,0));
	while(!pq.empty()){
		Node cur=pq.top();pq.pop();
		if(cur.at==ed)return cur.cost;
//		cout<<"now:"<<cur.at<<endl;
		for(int i=1;i<=n;i++){
			if((judge&&timeMap[cur.at][i]==MAX)||(!judge&&feeMap[cur.at][i]==MAX)||cur.at==i)continue;
			int cost=judge?timeMap[cur.at][i]:feeMap[cur.at][i];
			if(minMap[i]<cur.cost+cost)continue;
			//cout<<"    next:"<<i<<endl;
			minMap[i]=cur.cost+cost;
			pq.push(Node(i,cur.cost+cost));
		}
	}
	cout<<"not found"<<endl;
	return MAX;
}

void init(){
	LP(i,MAX_ST){LP(j,MAX_ST)feeMap[i][j]=timeMap[i][j]=MAX;}
}
void init2(){
	LP(i,MAX_ST){visited[i]=false;minMap[i]=MAX;}
}
void printMap(int n){
	LP(i,n){LP(j,n)printf("%8d",feeMap[i][j]!=MAX?feeMap[i][j]:-1);cout<<endl;}
	cout<<"---------------------------------------------------------"<<endl;
	LP(i,n){LP(j,n)printf("%8d",timeMap[i][j]!=MAX?timeMap[i][j]:-1);cout<<endl;}
}
int main(){
	int n,m;
	while(cin>>n>>m&&(n||m)){
		init();
		//ツ静シツ路ツ湘ョツ陛ア
		for(int a,b,cost,time;n--&&cin>>a>>b>>cost>>time;){
			if(feeMap[a][b]>cost)feeMap[a][b]=feeMap[b][a]=cost;
			if(timeMap[a][b]>time)timeMap[a][b]=timeMap[b][a]=time;
		}
//		printMap(m);
		int d;
		cin>>d;
		//ツ姪「ツつ「ツ債づュツつケ
		for(int p,q,r;d--&&cin>>p>>q>>r;){
			init2();
//			cout<<"@========== "<<p<<" to "<<q<<" ======="<<endl;
			cout<<dijkstra(p,q,m,r)<<endl;
		}
	}
	return 0;
}