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<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(nodesList[candidate[j].name - 1].fixed == true)
				{
					continue;
				}*/

				/*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>
using namespace std;

static const int MAX_ST = 100;
static const int INFTY  = ( 1 << 25 );

pair< int, int > AdjMt[MAX_ST][MAX_ST];	// first : cost, second : time

int Min( const int& left, const int& right ) {

	return left > right ? right : left;

}

int main()
{

	ios::sync_with_stdio( false );	// for speeding up

	int  info_n, sta_n, query_n, depplc, dest, cost, time;
	bool query_meth;

	while( cin >> info_n >> sta_n, info_n || sta_n ) {

		for( int i = 0; i < MAX_ST; i++ ) {
			for( int j = 0; j < MAX_ST; j++ ) AdjMt[i][j].first = AdjMt[i][j].second = INFTY;
		}

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

			cin >> depplc >> dest >> cost >> time;
			AdjMt[--depplc][--dest].first = cost;
			AdjMt[depplc][dest].second    = time;

		}

		// Warshall-Floyd
		for( int k = 0; k < sta_n; k++ ) {
			for( int i = 0; i < sta_n; i++ ) {
				for( int j = 0; j < sta_n; j++ ) {

					AdjMt[i][j].first  = Min( AdjMt[i][j].first, AdjMt[i][k].first + AdjMt[k][j].first );
					AdjMt[i][j].second = Min( AdjMt[i][j].second, AdjMt[i][k].second + AdjMt[k][j].second );

				}
			}
		}

		cin >> query_n;
		for( int i = 0; i < query_n; i++ ) {

			cin >> depplc >> dest >> query_meth;
			depplc--; dest--;
			cout << ( !query_meth ? AdjMt[depplc][dest].first : AdjMt[depplc][dest].second ) << endl;

		}

	}

	return 0;

}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;


int dpt[111][111];
int dpc[111][111];
int n, m, a, b, cost, t, k, p, q, r;

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, 111)REP(j, 111){
			if (i == j){
				dpt[i][j] = 0;
				dpc[i][j] = 0;
			}
			else{
				dpt[i][j] = INF;
				dpc[i][j] = INF;
			}
		}
		REP(i, n){
			cin >> a >> b >> cost >> t;
			dpt[a][b] = t;
			dpt[b][a] = t;
			dpc[a][b] = cost;
			dpc[b][a] = cost;
		}
		FOR(i, 1, m + 1){
			FOR(j, 1, m + 1){
				FOR(k, 1, m + 1){
					dpt[i][j] = min(dpt[i][j], dpt[i][k] + dpt[k][j]);
					dpc[i][j] = min(dpc[i][j], dpc[i][k] + dpc[k][j]);
				}
			}
		}
		cin >> k;
		REP(i, k){
			cin >> p >> q >> r;
			if (r == 0)cout << dpc[p][q] << endl;
			else cout << dpt[p][q] << endl;
		}
	}
}