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>
#include<vector>
#include<map>
#include<queue>
#define INF (1<<30)
#define COST 0
#define TIME 1

using namespace std;

typedef pair<int, int> p;

vector<p> costs[105], times[105];
int dist[105];
void dijkstra(vector<p> *edge, int s){
	fill(dist, dist + 105, INF);
	dist[s] = 0;
	priority_queue<p, vector<p>, greater<p>> q;
	q.push(p(0, s));
	while(!q.empty()){
		p tmp = q.top();q.pop();
		int d = tmp.first, from = tmp.second;
		if(dist[from] < d)continue;		
		for(int i = 0; i < edge[from].size(); i++){
			int to = edge[from][i].first, c = edge[from][i].second;
			if(dist[to] < dist[from] + c)continue;
			dist[to] = dist[from] + c;
			q.push(p(dist[to], to));
		}
	}
}

int main(){
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < n; i++){
		int a, b, c, t;
		cin >> a >> b >> c >> t;
		costs[a].push_back(p(b, c));
		costs[b].push_back(p(a, c));
		times[a].push_back(p(b, t));
		times[b].push_back(p(a, t));
	}
	int k;
	cin >> k;
	for(int i = 0; i < k; i++){
		int p, q, r;
		cin >> p >> q >> r;
		if(r == COST){
			dijkstra(costs, p);
		}else{
			dijkstra(times, p);
		}
		cout << dist[q] << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;

int main(){
	while(1){
		int n, m, k;
		int t[2][101][101];
		
		scanf(" %d %d", &n, &m);
		if(n==0) break;
		memset(t, -1, sizeof(t));
		
		for(int i=0; i<n; ++i){
			int a, b, time, cost;
			scanf(" %d %d %d %d", &a, &b, &cost, &time);
			t[0][a][b]=t[0][b][a]=cost;
			t[1][a][b]=t[1][b][a]=time;
		}
		
		scanf(" %d", &k);
		for(int i=0; i<k; ++i){
			int p, q, r;
			scanf(" %d %d %d", &p, &q, &r);
			long a[101]; //各駅までの最小値
			
			for(int j=0; j<=100; ++j) a[j]=50000000;
			
			//bfs
			queue<int> que;
			a[p]=0;
			que.push(p);
			while( !que.empty() ){
				int v=que.front();
				que.pop();
				for(int j=1; j<=m; ++j){
					if(t[r][v][j]>=0 && a[j]>t[r][v][j]+a[v]){
						a[j]=t[r][v][j]+a[v];	
						que.push(j);
					}
				}	
			}
			
			printf("%ld\n",a[q]);
		}
	}
}

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==0 && m==0) 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;
}