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]
					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>
#include<vector>

using namespace std;

int data_cost[101][101],data_time[101][101],prev[101][101],total_cost[101][101],total_time[101][101];
vector<int> array[101];

void serch(int st,int now)
{
	int i,flag=0;
	for(i=0;i<array[now].size();i++)
	{
		if(prev[now][array[now][i]]==1)
			flag++;
	}
	if(flag==array[now].size())
	{
		return ;
	}
	else
	{
		total_cost[st][st]=0;
		total_time[st][st]=0;
		for(i=0;i<array[now].size();i++)
		{
			if(prev[now][array[now][i]]!=1)
			{
				if(total_cost[st][array[now][i]]>total_cost[st][now]+data_cost[now][array[now][i]])
				{
					total_cost[st][array[now][i]]=total_cost[st][now]+data_cost[now][array[now][i]];
				}
				if(total_time[st][array[now][i]]>total_time[st][now]+data_time[array[now][i]][now])
				{
					total_time[st][array[now][i]]=total_time[st][now]+data_time[array[now][i]][now];
				}
			}
			prev[now][array[now][i]]=prev[array[now][i]][now]=1;
		}
		for(int j=0;j<array[now].size();j++)
		{
			serch(st,array[now][j]);
		}
	}
	return ;
}


int main()
{
	
	int n,m,i,j;
	
	for(;;)
	{
		cin >> n >> m ;
		if(n==0 && m==0)
			break;
		
		
		for(i=0;i<101;i++)
		{
			array[i].clear();
		}
		
		for(i=0;i<n;i++)
		{
			int a,b,cost,time;
			cin >> a >> b >> cost >> time ;
			array[a].push_back(b);
			array[b].push_back(a);
			data_cost[a][b]=cost;
			data_time[a][b]=time;
			data_cost[b][a]=cost;
			data_time[b][a]=time;
		}
		
		for(i=1;i<m+1;i++)
		{
			for(j=1;j<m+1;j++)
			{
				total_cost[i][j]=1000000;
				total_time[i][j]=1000000;
				for(int k=1;k<m+1;k++)
				{
					prev[j][k]=0;
				}
			}
			serch(i,i);
		}
		int  num;
		cin >> num ;
		
		for(int k=0;k<num;k++)
		{
			int st,en,se;
			cin >> st >> en >> se ;
			
			int ans;
			if(se==0)
			{
				if(total_cost[st][en]<total_cost[en][st])
					ans=total_cost[st][en];
				else
					ans=total_cost[en][st];
				
				cout << ans << endl;
				
			}
			else
			{
				if(total_time[st][en]<total_time[en][st])
					ans=total_time[st][en];
				else
					ans=total_time[en][st];
				
				cout << ans << endl;
			}
		}
	}
}

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 *dd = new unsigned int[n];


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


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

	dd[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 || dd[v] < dd[u]))
			u = v;


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


		if(u == -1) break;

		used[u] = true;


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

	}


	for(int i = 0; i < n; i++)
		ary[m][s][i] = dd[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] = {0}, // 駅番号aの配列

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

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

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

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

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

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

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

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

	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;
		int aa, bb, c, t;

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

			cin >> aa;

			cin >> bb;

			cin >> c;

			cin >> t;

		}


			// 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;


		// 問い合わせ
		int pp, qq, rr;
		for(int i = 0; i < enquiry; i++) {

			cin >> pp;

			cin >> qq;

			cin >> rr;

		}


		// 数合わせ.

		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 << q[i] << endl;

	}


	return 0;

}