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>


const unsigned int inf = 1 << 26;

const int MAX_OF_INFOMATIONS = 300; // 路線情報の最大数

const int MAX_OF_STATIONS = 100; // 駅の最大数

const int MAX_OF_ENQUIRIES = 200; // 問い合わせの最大数

using namespace std;

// 大工ストアならぬダイクストラ

int dijk(int m, int n, int s, int g[2][MAX_OF_STATIONS][MAX_OF_STATIONS], int ary[2][MAX_OF_STATIONS][MAX_OF_STATIONS]) {

	bool *used = new bool[n];

	unsigned int *d = new unsigned int[n];


	// std::cout << "n = " << n << " " << "s = " << s << std::endl;


	for(int i = 0; i < n; i++)
		d[i] = inf;

	d[s] = 0;

	for(int i = 0; i < n; i++)
		used[i] = false;


	while(true) {

		int u = -1;

		for(int v = 0; v < n; v++)

		if(!used[v] && (u == -1 || d[v] < d[u]))
			u = v;


			// std::cout << "u = " << u << std::endl;


		if(u == -1) break;

		used[u] = true;


		for(int v = 0; v < n; v++)
			if(d[v] > d[u] + g[m][u][v])
				d[v] = d[u] + g[m][u][v];

	}


	for(int i = 0; i < n; i++)
		ary[m][s][i] = d[i];


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

// std::cout << "d[" << i << "] = " << d[i] << std::endl;


	return 0;

}


int main() {

	int a[MAX_OF_INFOMATIONS] = {}, // 駅番号aの配列

	b[MAX_OF_INFOMATIONS] = {}, // 駅番号bの配列

	cost[MAX_OF_INFOMATIONS] = {}, // aからbまでの運賃

	time[MAX_OF_INFOMATIONS] = {}, // aからbまでの移動時間

	p[MAX_OF_ENQUIRIES] = {}, // 始点a

	q[MAX_OF_ENQUIRIES] = {}, // 終点b

	r[MAX_OF_ENQUIRIES] = {}, // 知りたい情報の種類

	d[2][MAX_OF_STATIONS][MAX_OF_STATIONS] = {},

	g[2][MAX_OF_STATIONS][MAX_OF_STATIONS] = {};

	int info, // 路線情報数

	station, // 駅の数

	enquiry; // 問い合わせ数


	while(true) {

		cin >> info;

		cin >> station;


		// 初期化処理

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

			for(int j = 0; j < station; j++) {

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

					g[i][j][k] = inf;

					d[i][j][k] = inf;

				}

			}

		}


		// inputが0 0だったら終了

		if(!info && !station) break;


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

			cin >> a[i];

			cin >> b[i];

			cin >> cost[i];

			cin >> time[i];

		}


			// a - 1, b - 1をする(駅番号が1からmまでである)

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

			a[i]--;

			b[i]--;

		}


			// 時間と運賃を配列に入れる

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

			g[0][a[i]][b[i]] = time[i];

			g[1][a[i]][b[i]] = cost[i];

			g[0][b[i]][a[i]] = time[i];

			g[1][b[i]][a[i]] = cost[i];


		}


		// 大工ストアじゃなくてダイクストラに入れる

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

//			dijk(0, station, i, g, d);

//			dijk(1, station, i, g, d);

		}


		cin >> enquiry;


		// 問い合わせ

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

			cin >> p[i];

			cin >> q[i];

			cin >> r[i];

		}


		// 数合わせ.

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

			p[i]--;

			q[i]--;

		}


// 表示

		for(int i = 0; i < enquiry; i++)

//			cout << d[!r[i]][p[i]][q[i]] << endl;

		cout << !0 << endl;

	}


	return 0;

}

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

const int INF = 2000;

struct LineTable{
  int cost;
  int times;
  LineTable(){
    cost = INF;
    times = INF;
  }
};

int main(){

    int n,m;
    while(1){
      cin >> n >> m;
      if(n==0&&m==0){
        break;
      }
      LineTable table[m][m];

      for(int i=0;i<n;i++){
        int a,b,cost,times;
        cin >> a >> b >> cost >> times;
        table[a-1][b-1].cost = cost;
        table[a-1][b-1].times = times;
      }

      for(int k=0;k<m;k++){
        for(int i=0;i<m;i++){
          for(int j=0;j<m;j++){
            if(table[i][j].cost > table[i][k].cost + table[k][j].cost){
              table[i][j].cost = table[i][k].cost + table[k][j].cost;
            }
          }
        }
      }

      for(int k=0;k<m;k++){
        for(int i=0;i<m;i++){
          for(int j=0;j<m;j++){
            if(table[i][j].times > table[i][k].times + table[k][j].times){
              table[i][j].times = table[i][k].times + table[k][j].times;
            }
          }
        }
      }

      int k,p,q,r;
      cin >> k;
      for(int i=0;i<k;i++){
        cin >> p >> q >> r;
        if(r==0){
          cout << table[p-1][q-1].cost << endl;
        }
        else{
          cout << table[p-1][q-1].times << endl;
        }
      }
    }
    return 0;
}

C++: #include<cstdio>
#include<queue>
using namespace std;
typedef pair<int,int> T;
typedef struct{
	T pair;
	int flg[300];
}P;
struct Root{
	int a,b;
	int cost,time;
}root[300];
int main(){
	int n,m;
	int p,q,r;
	int k;
	scanf("%d %d",&n,&m);
	while(n!=0&&m!=0){
		for(int i=0;i<n;i++){
			scanf("%d %d %d %d",&root[i].a,&root[i].b,&root[i].cost,&root[i].time);
		}
		scanf("%d",&k);
		for(int i=0;i<k;i++){
			scanf("%d %d %d",&p,&q,&r);
			queue<P> que;
			int sum=10000;
			P t;
			t.pair=make_pair(p,0);
			que.push(t);

			while(!que.empty()){
				P temp=que.front();
				P temp2=temp;
				que.pop();

				for(int i2=0;i2<n;i2++){
					if(temp.pair.first==q){
						sum=min(sum,temp.pair.second);
					}
					if(root[i2].a==temp.pair.first&&temp.flg[temp.pair.first-1]!=-1){
						temp2.flg[temp.pair.first-1]=-1;
						if(r==0){
							temp2.pair=make_pair(root[i2].b,temp.pair.second+root[i2].cost);
							que.push(temp2);
						}
						if(r==1){
							temp2.pair=make_pair(root[i2].b,temp.pair.second+root[i2].time);
							que.push(temp2);
						}
						
					}
					if(root[i2].b==temp.pair.first&&temp.flg[temp.pair.first-1]!=-1){
						temp2.flg[temp.pair.first-1]=-1;
						if(r==0){
							temp2.pair=make_pair(root[i2].a,temp.pair.second+root[i2].cost);
							que.push(temp2);
						}
						if(r==1){
							temp2.pair=make_pair(root[i2].a,temp.pair.second+root[i2].time);
							que.push(temp2);
						}
						
					}

				}
			}

			printf("%d\n",sum);
		}
		scanf("%d %d",&n,&m);
	}
	return 0;
}