Go: // Warshall–Floyd Algorithm

package main

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

var scanner = bufio.NewScanner(os.Stdin)

const INF = 2000000000

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++: #define _CRT_SECURE_NO_WARNINGS

#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

short cost[110][110];
short time_data[110][110];


int main(){
	short n, m;


	while (cin >> n >> m && (n != 0 && m != 0)) {
		short min_ = 2000; // 答えの最小値
		short min_num = 1; // 答えの町

		short from, to, time_, cost_;
		short k;
		short k_from, k_to, info;

		for (short i = 0; i < 110; i++) {
			for (short j = 0; j < 110; j++) {
				cost[i][j] = 2000;
				time_data[i][j] = 2000;
			}
		}
		for (short i = 0; i < 3000; i++) {
			cost[i][i] = 0;
		}
		for (short i = 0; i < n; i++) {
			cin >> from >> to >> cost_ >> time_;
			cost[from][to] = cost_;
			cost[to][from] = cost_;
			time_data[from][to] = time_;
			time_data[to][from] = time_;
		}
		for (short k = 1; k <= m; k++) {
			for (short i = 1; i <= m; i++) {
				for (short j = 1; j <= m; j++) {
					cost[i][j] = min((int)cost[i][j], cost[i][k] + cost[k][j]);

					time_data[i][j] = min((int)time_data[i][j], time_data[i][k] + time_data[k][j]);
				}
			}
		}
		// 答えを求める
		cin >> k;
		for (short i = 0; i < k; i++) {
			cin >> k_from >> k_to >> info;
			if (info == 0) {
				cout << cost[k_from][k_to] << endl;
			} else {
				cout << time_data[k_from][k_to] << endl;
			}
		}
		
  }
	return 0;
}

C++: #include <iostream>
const int MAX_E = 300, MAX_V = 100, INF = 1000000;
struct edge{int from, to, time, cost;};

edge es[MAX_E+1];
int d[MAX_V+1];
int n, m, k;

//0: time 1: cost
int minimum_value(int type, int start, int end){
	for(int i=1;i<=m;i++)d[i] = INF;
	d[start] = 0;

	int res = 0;
	while(true){
		bool update = false;
		for(int i=0;i<n;i++){
			edge e = es[i];
			int cost = type?e.cost:e.time;
			if(d[e.from] != INF && d[e.to] > d[e.from] + cost){
				d[e.to] = d[e.from] + cost;
				res = d[e.to];
				update = true;
			}		
		}
		if(!update)break;
	}

	return res;
}

int main(){
	while(std::cin >> n >> m, n){
		for(int i=0;i<n;i++){
			int from, to, time, cost;
			std::cin >> from >> to >> time >> cost;
			edge e;
			e.from = from, e.to = to, e.time = time, e.cost = cost;
			es[i] = e;
		}

		std::cin >> k;
		for(int j=0;j<k;j++){
			int start, end, type;
			std::cin >> start >> end >> type;
			std::cout << minimum_value(type, start, end) << std::endl;
		}
	}

	return 0;
}

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

struct AboutTo;

class Node{
public:
	int aa;
	int Lowest;
	bool IsSelected;
	vector<AboutTo> ToCollection;
	Node(){
		Lowest = 2147483647/2;
		IsSelected = false;
	}
	void Reset(){
		Lowest = 2147483647/2;
		IsSelected = false;
	}
};
struct AboutTo{
	Node* To;
	int Cost;
	int Time;
};

int GetShortest(int a, int b, vector<Node> &aNodeCol, const int IsTime){
	aNodeCol[a].IsSelected = true;
	int TempMin = 2147483647/2;
	int aNode;
	//Node fad;
	for (unsigned int i = 0; i < aNodeCol.size(); ++i){
		if (aNodeCol[i].IsSelected){
			for (unsigned int j = 0; j < aNodeCol[i].ToCollection.size(); ++j){
				if (!(*(aNodeCol[i].ToCollection[j].To)).IsSelected){
					if (IsTime){
						if (TempMin>aNodeCol[i].Lowest + aNodeCol[i].ToCollection[j].Time){
							TempMin = aNodeCol[i].Lowest + aNodeCol[i].ToCollection[j].Time;
							aNode = (*(aNodeCol[i].ToCollection[j].To)).aa;
							//fad = *aNodeCol[i].ToCollection[j].To;
						}
					}
					else{
						if (TempMin>aNodeCol[i].Lowest + aNodeCol[i].ToCollection[j].Cost){
							TempMin = aNodeCol[i].Lowest + aNodeCol[i].ToCollection[j].Cost;
							aNode = (*(aNodeCol[i].ToCollection[j].To)).aa;
							//fad = *aNodeCol[i].ToCollection[j].To;
						}
					}
				}
			}
		}
	}
	if (b != aNode){
		aNodeCol[aNode].Lowest = TempMin;
		return GetShortest(aNode, b, aNodeCol, IsTime);
	}
	/*if (GoalNode != fad){
		aNodeCol[aNode].Lowest = TempMin;
		return GetShortest(aNode, GoalNode, b, aNodeCol, IsTime);
	}*/
	return TempMin;
}

int main(){
	int n, m;
	cin >> n >> m;
	vector<Node> NodeCollection;
	for (int i = 0; i < m; ++i){
		Node aNode;
		aNode.aa = i;
		NodeCollection.push_back(aNode);
	}

	for (int i = 0; i < n; ++i){
		int a, b, cost, time;
		cin >> a >> b >> cost >> time;
		NodeCollection[a - 1].ToCollection.push_back({ &NodeCollection[b - 1], cost, time });
		NodeCollection[b - 1].ToCollection.push_back({ &NodeCollection[a - 1], cost, time });
	}
	int k;
	cin >> k;
	for (int i = 0; i < k; ++i){
		int p, q, r;
		cin >> p >> q >> r;
		NodeCollection[p - 1].Lowest = 0;
		cout << GetShortest(p - 1, q - 1, NodeCollection, r) << endl;
		for (auto i = NodeCollection.begin(); i != NodeCollection.end(); ++i){
			(*i).Reset();
		}
	}
	cin >> k >> k;
	return 0;
}