Go: // Warshall–Floyd Algorithm

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

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
					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>
#include<vector>
using namespace std;
class NextNodesData
{
public:	
	int nextNodesName;
	int nextNodesMany;
	int nextNodesTime;
};
class Nodes
{
public:
	vector<NextNodesData> nextNodes;
	int name;
	int minValue;
	bool fixed;
};

int main()
{
	int N, M;
	cin >> N >> M;
	vector<Nodes> nodesList;
	for(int i = 0; i < M; i++)
	{
		Nodes nodes;
		nodes.name = i+1;
		nodesList.push_back(nodes);
	}
	for(int i = 0; i < N; i++)
	{
		int Start;
		int End;
		int Many;
		int Time;
		cin >> Start >> End >> Many >> Time;

		NextNodesData nodes;
		nodes.nextNodesName = End;
		nodes.nextNodesMany = Many;
		nodes.nextNodesTime = Time;
		nodesList[Start - 1].nextNodes.push_back(nodes);
	}

	int Query;
	cin >> Query;

	for(int i = 0; i < Query; i++) 
	{
		
		 //???????????????
		for(int j = 0; j < nodesList.size(); j++)
		{
			nodesList[j].fixed = false;
		}
		int Start;
		int End;
		int mode;
		
		cin >> Start >> End;
		cin >> mode;

		if(Start == End)
		{
			cout << 0 << endl;
			continue;
		}

		nodesList[Start - 1].fixed = true;
		nodesList[Start - 1].minValue = 0;
		int nextFixedNodesName = Start;

		

		vector<Nodes> candidate;
		while(1)
		{
			//??????????¢????????????°??????????´????????????????????????¨???????????????????????????
			for(int j = 0; j < nodesList[nextFixedNodesName - 1].nextNodes.size(); j++)
			{
				
				Nodes obj;
				obj.name = nodesList[nextFixedNodesName - 1].nextNodes[j].nextNodesName;
				//??¢??????????????????????????????????????????????????????
				if(nodesList[obj.name - 1].fixed == true)
				{
					continue;
				}
				if(mode == 0)
				{
					obj.minValue = nodesList[nextFixedNodesName - 1].minValue + nodesList[nextFixedNodesName - 1].nextNodes[j].nextNodesMany;
				}
				else
				{
					obj.minValue = nodesList[nextFixedNodesName - 1].minValue + nodesList[nextFixedNodesName - 1].nextNodes[j].nextNodesTime;
				}
				//?¬???????????????????????????????????????????
				candidate.push_back(obj);				   
			}

			int minValue = 1001;
			int minName  = -1;
			//?¬????????????????????£???????????°???????????????¢???
			for(int j = 0; j < candidate.size(); j++)
			{
				if(candidate.size() == 0)
				{
					cout << 0 << endl;
				}
				if(candidate[j].minValue < minValue)
				{
					minValue = candidate[j].minValue;
					minName = candidate[j].name;
				}  
			}
			if(minName == End)
			{
				cout << minValue << endl;
				break;
			}
			nodesList[minName - 1].minValue = minValue;
			nodesList[minName - 1].fixed = true;
			nextFixedNodesName = minName;

			
			for(auto itr = candidate.begin(); itr != candidate.end();)
			{
				if(nodesList[itr->name - 1].fixed == true)
				{
					itr = candidate.erase(itr);
				}
				else
				{
					itr++;
				}
			}
		}	
		

	} 

	return 0;

}

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;


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

	}


	return 0;

}