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>
#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;
}

C++: #include<iostream>
using namespace std;
#define INF 100000000
int main(){
  int n,m,k;
  while(cin>>n>>m){
    if(n==0&&m==0) break;
    int glaf[m+1][m+1][2];
    for(int i=0;i<=m;i++){
      for(int j=0;j<=m;j++)
        glaf[i][j][0] = glaf[i][j][1] = INF;
      glaf[i][i][0] = glaf[i][i][1] = 0;
    }
    int a,b,cost,time;
    for(int i=0;i<n;i++){
      cin >> a >> b >> cost >> time;
      glaf[a][b][0] = glaf[b][a][0] = cost;
      glaf[a][b][1] = glaf[b][a][1] = time;
    }
    for(int x=1;x<=m;x++){
      for(int i=1;i<=m;i++){
        for(int j=1;j<=m;j++){
          glaf[i][j][0] = min(glaf[i][j][0],glaf[i][x][0]+glaf[x][j][0]);
          glaf[i][j][1] = min(glaf[i][j][1],glaf[i][x][1]+glaf[x][j][1]);
        }
      }
    }
    cin >> k;
    int p,q,r;
    for(int i=0;i<k;i++){
      cin >> p >> q >> r;
      cout << glaf[p][q][r] << endl;
    }
  }
}

C++: #include <bits//stdc++.h>
using namespace std;
int main(void){
    while(1){
        int a,b,c,i,j,k,f;
    cin>>b>>a;
    if(a==0&&b==0)
    break;
    int train_cost[a][a];
    int train_time[a][a];
    for(i=0;i<a;i++){
        for(j=0;j<a;j++){
            if(i==j){
                train_time[i][j]=0;
                train_cost[i][j]=0;
            }
            else{
                train_time[i][j]=INT_MAX/2;
                train_cost[i][j]=INT_MAX/2;
            }
        }
    }
    for(i=0;i<b;i++){
        int d,e;
        cin>>d>>e;
        cin>>train_cost[d-1][e-1]>>train_time[d-1][e-1];
        train_cost[e-1][d-1]=train_cost[d-1][e-1];
        train_time[e-1][d-1]=train_time[d-1][e-1];
    }
    for(k=0;k<a;k++){
        for(j=0;j<a;j++){
            for(i=0;i<a;i++){
                train_cost[i][j]=min(train_cost[i][j],train_cost[i][k]+train_cost[k][j]);
                train_time[i][j]=min(train_time[i][j],train_time[i][k]+train_time[k][j]);
            }
        }
    }
    cin>>f;
    for(i=0;i<f;i++){
        int d,e;
        cin>>d>>e>>c;

        if(c)
        cout<<train_time[d-1][e-1]<<endl;
        else
        cout<<train_cost[d-1][e-1]<<endl;
    }
    }
    return 0;
}

C++: #include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <queue>

using namespace std;

int main(){

	int n,m,min_time[101][101],min_cost[101][101],from,to,cost,time,num,r;

	while(true){
		scanf("%d %d",&n,&m);
		if(n == 0 && m == 0)break;

		for(int i = 1; i <= m; i++){
			for(int k = 1; k <= m; k++){
				if(i != k){
					min_time[i][k] = 2000000000;
					min_cost[i][k] = 2000000000;
				}else{
					min_time[i][k] = 0;
					min_cost[i][k] = 0;
				}
			}
		}

		for(int i = 0; i < n; i++){
			scanf("%d %d %d %d",&from,&to,&cost,&time);
			min_time[from][to] = time;
			min_cost[from][to] = cost;
		}

		for(int k = 1; k <= m; k++){
			for(int i = 1; i <= m; i++){
				if(min_time[i][k] == 2000000000)continue;
				for(int p = 1; p <= m; p++){
					if(min_time[k][p] == 2000000000)continue;
					min_time[i][p] = min(min_time[i][p],min_time[i][k] + min_time[k][p]);
				}
			}

			for(int i = 1; i <= m; i++){
				if(min_cost[i][k] == 2000000000)continue;
				for(int p = 1; p <= m; p++){
					if(min_cost[k][p] == 2000000000)continue;
					min_cost[i][p] = min(min_cost[i][p],min_cost[i][k] + min_cost[k][p]);
				}
			}
		}

		scanf("%d",&num);

		for(int i = 0; i < num; i++){
			scanf("%d %d %d",&from,&to,&r);
			if(r == 1){
				printf("%d\n",min_time[from][to]);
			}else{
				printf("%d\n",min_cost[from][to]);
			}
		}
	}

	return 0;
}