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;

#define STAT_MAX 100
#define LINE_MAX 3000

int main(){
	int n,m,a,b;
	int start,goal,flg;

	int i,j;

	int lineNum;
	int lineCost[LINE_MAX][2];	//[lineId][flg]?????????????????????????????????

	int statNum;
	int statToNum[STAT_MAX];	//[statId]??\?¶???????????????????????????°
	int statTo[STAT_MAX][STAT_MAX];	//[statId][i]??\?¶??????????????????????????????????????????£????????????
	int statToId[STAT_MAX][STAT_MAX];	//[statId][i]??\?¶?????????????????????????id

	int yetNum;
	int yetId[STAT_MAX];	//?????¢?´¢???statId
	int yetDepth[STAT_MAX];	//?????¢?´¢???stat???????§???????
	int yetCost[STAT_MAX];	//?????¢?´¢???stat?????????????????????????????????
	int nowId,nowDepth,nowCost;

	int searchedNum;
	int searchedId[STAT_MAX];	//??¢?´¢?????????ID?????????
	int searchedTotal[STAT_MAX];	//?????????????´???????
	int result;

	while(1){
		//???????????±
		cin>>n>>m;if(!n && !m) break;
		lineNum=n;statNum=m;
		while(m--) statToNum[m]=0;
		for(i=0;i<n;i++){
			cin>>a>>b>>lineCost[i][0]>>lineCost[i][1];
			a--;b--;
			statTo[a][statToNum[a]]=b;statTo[b][statToNum[b]]=a;
			statToId[a][statToNum[a]]=i;statToId[b][statToNum[b]]=i;
			statToNum[a]++;statToNum[b]++;
		}
		//???????????????
		cin>>n;
		while(n--){
			cin>>start>>goal>>flg;
			start--;goal--;
			result=-1;yetNum=0;searchedNum=0;
			yetId[yetNum]=start;yetDepth[yetNum]=-1;yetCost[yetNum]=0;yetNum++;
			while(yetNum--){
				//?????¢?´¢stat???????????????
				nowId=yetId[yetNum];
				nowDepth=yetDepth[yetNum];
				nowCost=yetCost[yetNum];
				//??¢?´¢???????????????
				searchedId[searchedNum]=nowId;
				searchedTotal[searchedNum]=searchedNum?searchedTotal[searchedNum-1]+nowCost:nowCost;
				searchedNum++;

				if(nowId==goal){
					if(result==-1 || searchedTotal[searchedNum-1]<result) result=searchedTotal[searchedNum-1];
					if(yetNum!=0) searchedNum=yetDepth[yetNum-1];
				}else{
					//??\?¶?????????????????§????????´¢????????¢?´¢??????yet?????????
					m=yetNum;	//??????????????????
					for(i=0;i<statToNum[nowId];i++){
						for(j=0;j<searchedNum-1;j++){
							if(statTo[nowId][i]==searchedId[j]) break;
						}
						if(j!=searchedNum-1) continue;
						yetId[yetNum]=statTo[nowId][i];
						yetDepth[yetNum]=nowDepth+1;
						yetCost[yetNum]=lineCost[statToId[nowId][i]][flg];
						yetNum++;
					}
					//??°?????§??????????????????
					if(m==yetNum){
						if(yetNum!=0) searchedNum=yetDepth[yetNum-1];
					}
				}
			}
			cout<<result<<endl;
		}
	}
	return 0;
}

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

const int INF = 1000000;
const int MMAX = 100;

int N, M;
int c[MMAX][MMAX];
int t[MMAX][MMAX];

bool input_map() {
  cin >> N >> M;
  if (!N && !M) {
    return false;
  }
  for (int i = 0; i < M; ++i) {
    for (int j = 0; j < M; ++j) {
      c[i][j] = INF;
      t[i][j] = INF;
    }
    c[i][i] = 0;
  }
  for (int i = 0; i < N; ++i) {
    int x, y, cc, tt;
    cin >> x >> y >> cc >> tt;
    --x, --y;
    c[x][y] = cc;
    c[y][x] = cc;
    t[x][y] = tt;
    t[y][x] = tt;
  }

  return true;
}

void prepare() {
  for (int k = 0; k < M; ++k) {
    for (int i = 0; i < M; ++i) {
      for (int j = 0; j < M; ++j) {
        c[i][j] = min(c[i][j], c[i][k] + c[k][j]);
        t[i][j] = min(t[i][j], t[i][k] + t[k][j]);
      }
    }
  }
}

int main() {
  while (input_map()) {
    prepare();
    int k;
    cin >> k;
    for (int i = 0; i < k; ++i) {
      int p, q, r;
      cin >> p >> q >> r;
      --p, --q;
      if (r) {
        cout << t[p][q] << endl;
      } else {
        cout << c[p][q] << endl;
      }
    }
  }
  return 0;
}

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

	return 0;
}