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>
#include<algorithm>
using namespace std;

const int LEN = 100;
const int INF = 10000;
int time[LEN][LEN];
int cost[LEN][LEN];


int main(void){
	while(1){
		//init
		int rosen,eki,a,b,incost,intime;
		for(int i=0; i<LEN; i++){ 
			for(int j=0; j<LEN; j++)
				time[i][j] = cost[i][j] = INF;
		}
		for(int i=0; i<LEN; i++)
			time[i][i] = cost[i][i] = 0;
	
		//in
		cin >> rosen >> eki; 
		if(rosen==0&&eki==0)break;
		for(int i=0; i<rosen; i++){
			cin >> a >> b >> incost >> intime;
			a--; b--;
			cost[a][b] = cost[b][a] = incost;
			time[a][b] = time[b][a] = intime;
		}

		//calc
		for(int k=0; k<eki; k++){
			for(int i=0; i<eki; i++){
				for(int j=0; j<eki; j++){
					time[i][j] = min(time[i][j],time[i][k]+time[k][j]);
					cost[i][j] = min(cost[i][j],cost[i][k]+cost[k][j]);
				}
			}
		}

		//out
		int toi;
		cin >> toi;
		for(int i=0; i<toi; i++){
			int a,b,r;
			cin >> a >> b >> r;
			a--; b--;
			if(r==0)
				cout << cost[a][b] << endl;
			else
				cout << time[a][b] << endl;
		}
	}

	return 0;
}

C++: #include<stdio.h>
int main(void){
	int i,j,k,n,m,a,b,cost[100][100],time[100][100],p,q,r;
	scanf("%d%d",&n,&m);
	while(n!=0 || m!=0){
		for(i=0; i<m; i++){
			for(j=0; j<m; j++){
				cost[i][j]=(i==j)?0:100001;
				time[i][j]=(i==j)?0:100001;
			}
		}
		for(i=0; i<n; i++){
			scanf("%d%d",&a,&b);
			scanf("%d%d",&cost[a-1][b-1],&time[a-1][b-1]);
			cost[b-1][a-1]=cost[a-1][b-1];
			time[b-1][a-1]=time[a-1][b-1];
		}
		for(i=0; i<m; i++){
			for(j=i; j<m; j++){
				for(k=i; k<m; k++){
					cost[i][j]=(cost[i][j]>cost[i][k]+cost[k][j])?(cost[i][k]+cost[k][j]):cost[i][j];
					cost[j][i]=cost[i][j];
					time[i][j]=(time[i][j]>time[i][k]+time[k][j])?(time[i][k]+time[k][j]):time[i][j];
					time[j][i]=time[i][j];
				}
			}
		}
		scanf("%d",&k);
		for(i=0; i<k; i++){
			scanf("%d%d%d",&p,&q,&r);
			printf("%d\n",(r==0)?cost[p-1][q-1]:time[p-1][q-1]);
		}
		scanf("%d%d",&n,&m);
	}
	return 0;
}

C++: #include<stdio.h>

int dijkstra(int, int, int, int, int**);

int main(void)
{
	int f1, f2, n, m, a, b, ic, ti, k, p, q, r, out, **cost, **time;

	while(scanf("%d %d",&n,&m) && n > 0)
	{

		cost = new int *[m];
		time = new int *[m];
		//線路設計
		for(f1 = 0; f1 < n; f1++)
		{
			cost[f1] = new int [m];
			time[f1] = new int [m];
			for(f2 = 0; f2 < m; f2++)
			{
				cost[f1][f2] = 0;
				time[f1][f2] = 0;
			}
		}
		//線路情報入力
		for(f1 = 0; f1 < n; f1++)
		{
			scanf("%d %d %d %d",&a, &b, &ic, &ti);
			a--;
			b--;
			cost[a][b] = ic;
			cost[b][a] = ic;
			time[a][b] = ti;
			time[b][a] = ti;
		}
		//問い合わせ入力
		scanf("%d",&k);
		for(f1 = 1; f1 <= k; f1++)
		{
			scanf("%d %d %d",&p, &q, &r);
			p--;
			q--;
			if(r == 0)
				out = dijkstra(n, m, p, q, cost);
			else
				out = dijkstra(n, m, p, q, time);

			printf("%d\n",out);
		}
	}
	return 0;
}

int dijkstra(int n, int m, int p, int q, int **temp)
{
	int *C, *sum, f1, po = p, min;
	//Cの中身　0：出発していない　1：出発した
	C = new int [m];
	sum = new int [m];
	//初期化
	for(f1 = 0; f1 < m; f1++)
	{
		C[f1] = 0;
		sum[f1] = 0;
	}
	//ダイクストラ探索
	while(po != q)
	{
		//現在いる地点から次の駅までにかかるコストを計算し次に行く駅の現時点での最小コストを求める
		for(f1 = 0; f1 < m; f1++)
		{
			if(temp[po][f1] > 0)
			{
				if(C[f1] == 0 && (sum[f1] == 0 || temp[po][f1] + sum[po] < sum[f1]))
					sum[f1] = temp[po][f1] + sum[po];
			}
		}
		//出発していない駅の中で最小コストを選択する
		min = 0;
		C[po] = 1;
		for(f1 = 0; f1 < m; f1++)
		{
			if(C[f1] == 0 && sum[f1] != 0 && (min == 0 || sum[f1] < min))
			{
				min = sum[f1];
				po = f1;
			}
		}
	}
	return sum[q];
}

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

int main(){
	vector< vector<short> > cost, time;
	vector<int> station;
	int n, m;
	while( cin >> n >> m, n||m ){
		cost.resize(m+1);
		time.resize(m+1);
		station.resize(m+1);
		for( int i=1; i<=m; i++ ){
			cost[i].resize(m+1);
			time[i].resize(m+1);
			for( int j=1; j<=m; j++ ){
				cost[i][j] = time[i][j] = -1;
			}
		}
		station.resize(m);
		for( int i=0; i<n; i++ ){
			int a, b, c, t;
			cin >> a >> b >> c >> t;
			cost[a][b] = cost[b][a] = c;
			time[a][b] = time[b][a] = t;
		}
		int k;
		cin >> k;
		for( int i=0; i<k; i++ ){
			int p, q, r;
			cin >> p >> q >> r;
			for( int j=1; j<=m; j++ ){
				station[j] = -1;
			}
			station[p] = 0;
			for( int z=0; z<m; z++ ){
				int ny=-1, nextVal=1000000;
				for( int x=1; x<=m; x++ ){
					if( station[x] != -1 ){
						for( int y=1; y<=m; y++ ){
							if( (station[y]==-1) && (cost[x][y] != -1) ){
								int val = station[x];
								if( r==0 )	// cost
									val += cost[x][y];
								else if( r==1 )	// time
									val += time[x][y];
								if( val < nextVal ){
									nextVal = val;
									ny = y;
								}
							}
						}
					}
				}
				station[ny] = nextVal;
				if( ny == q )	break;
			}
			cout << station[q] << endl;
		}
	}	
	return 0;
}