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]=0;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 <cstdio>
#include <algorithm>
using namespace std;
int main(void){

	int n, m, a, b, cost, time, k, p, q, r;
	int d_cost[101][101], d_time[101][101];

	while (cin >> n >> m && n != 0 && m != 0){

		for (int i = 1; i < m + 1; i++){
			for (int j = 1; j < m + 1; j++){

				d_cost[i][j] = 1001;
				d_time[i][j] = 1001;
			}
		}

		for (int i = 0; i < n; i++){

			cin >> a >> b >> cost >> time;
			d_cost[a][b] = cost;
			d_cost[b][a] = cost;
			d_time[a][b] = time;
			d_time[b][a] = time;
		}

		/*cout << endl;
		for (int i = 1; i < m; i++){
			for (int j = 1; j < m; j++){

				printf("%5d", d_cost[i][j]);
			}
			cout << endl;
		}
		cout << endl;
		for (int i = 1; i < m; i++){
			for (int j = 1; j < m; j++){

				printf("%5d", d_time[i][j]);
			}
			cout << endl;
		}*/

		for (int i = 1; i < m + 1; i++){
			for (int j = 1; j < m + 1; j++){
				for (int k = 1; k < m + 1; k++){

					d_cost[j][k] = min(d_cost[j][k], d_cost[j][i] + d_cost[i][k]);
					d_time[j][k] = min(d_time[j][k], d_time[j][i] + d_time[i][k]);
				}
			}
		}

		cin >> k;

		for (int i = 0; i < k; i++){

			cin >> p >> q >> r;

			if (r == 0)
				cout << d_cost[p][q] << endl;
			else
				cout << d_time[p][q] << endl;
		}
	}
}

C++: #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
using namespace std;
main(){
  int m,n;
  while(cin>>m>>n,n){
    int a1[n][n],a2[n][n],q,w,e,r;
    r(i,n)r(j,n){
      if(i==j)a2[i][j]=a1[i][j]=0;
      else a2[i][j]=a1[i][j]=INF;
    }
    while(m--){
      scanf("%d%d%d%d",&q,&w,&e,&r);q--;w--;
      a1[q][w]=a1[w][q]=e;
      a2[q][w]=a2[w][q]=r;
    }
    r(k,n)r(i,n)r(j,n){
      a1[i][j]=min(a1[i][j],a1[i][k]+a1[k][j]);
      a2[i][j]=min(a2[i][j],a2[i][k]+a2[k][j]);
    }
    cin>>e;
    while(e--){
      scanf("%d%d%d",&q,&w,&r)q--;w--;
      if(r)cout<<a2[q][w]<<endl;
      else cout<<a1[q][w]<<endl;
    }
  }
}