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++: #include <stdio.h>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>

using namespace std ;

struct Node
{
	int P ;
	int C ;
	Node ( ) { }
	Node ( int a , int b )
	{
		P = a ;
		C = b ;
	}
	bool operator < ( const Node &a ) const
	{
		return C > a.C ;
	}
} ;

vector < int > ListofRoad [110] ;
vector < int > ListofTime [110] ;
vector < int > ListofCost [110] ;

int CostAns [110][110] ;
int TimeAns [110][110] ;
bool vis[110] ;

void init ( ) ;
void Dijkstra ( int , int , int ) ;

int main ( )
{
	int n ;
	int m ;
	while ( scanf ( "%d %d" , &n , &m ) == 2 && ( n || m ) )
	{
		init ( ) ;
		for ( int i = 0 ; i < n ; i++ )
		{
			int a ;
			int b ;
			int c ;
			int d ;
			scanf ( "%d %d %d %d" , &a , &b , &c , &d ) ;
			ListofRoad[a].push_back ( b ) ;
			ListofCost[a].push_back ( c ) ;
			ListofTime[a].push_back ( d ) ;
			ListofRoad[b].push_back ( a ) ;
			ListofCost[b].push_back ( c ) ;
			ListofTime[b].push_back ( d ) ;
		}
		int Q ;
		scanf ( "%d" , &Q ) ;
		while ( Q-- )
		{
			int p ;
			int q ;
			int r ;
			scanf ( "%d %d %d" , &p , &q , &r ) ;
			if ( CostAns[p][1] == -1 && TimeAns[p][1] == -1 )
			{
				Dijkstra ( p , m , 0 ) ;
				Dijkstra ( p , m , 1 ) ;
			}
			if ( r == 0 )
			{
				printf ( "%d\n" , CostAns[p][q] ) ;
			}
			else
			{
				printf ( "%d\n" , TimeAns[p][q] ) ;
			}
		}
	}
	return 0 ;
}

void init ( )
{
	for ( int i = 0 ; i < 110 ; i++ )
	{
		ListofRoad[i].clear ( ) ;
		ListofTime[i].clear ( ) ;
		ListofCost[i].clear ( ) ;
	}
	memset ( CostAns , -1 , 110 * 110 * sizeof ( int ) ) ;
	memset ( TimeAns , -1 , 110 * 110 * sizeof ( int ) ) ;
}

void Dijkstra ( int source , int m , int type )
{
	memset ( vis , false , 110 * sizeof ( bool ) ) ;
	priority_queue < struct Node > pQ ;
	if ( type == 0 )
	{
		TimeAns[source][source] = 0 ;
	}
	else
	{
		CostAns[source][source] = 0 ;
	}
	pQ.push ( Node ( source , 0 ) ) ;
	for ( int i = 1 ; i <= m ; i++ )
	{
		struct Node var = ( struct Node ) { -1 , -1 } ;
		while ( pQ.empty ( ) == false && vis[( var = pQ.top ( ) ).P] == true )
		{
			pQ.pop ( ) ;
		}
		if ( var.P == -1 )
		{
			break ;
		}
		vis[var.P] = true ;
		if ( type == 0 )
		{
			vector < int > :: iterator iu = ListofTime[var.P].begin ( ) ;
			for ( vector < int > :: iterator it = ListofRoad[var.P].begin ( ) ;
				it != ListofRoad[var.P].end ( ) ;
				it++ , iu++ )
			{
				if ( vis[*it] == false )
				{
					if ( TimeAns[source][*it] == -1 || ( TimeAns[source][*it] > var.C + *( iu ) ) )
					{
						TimeAns[source][*it] = var.C + *( iu ) ;
						pQ.push ( Node ( *it , TimeAns[source][*it] ) ) ;
					}
				}
			}
		}
		else
		{
			vector < int > :: iterator iu = ListofCost[var.P].begin ( ) ;
			for ( vector < int > :: iterator it = ListofRoad[var.P].begin ( ) ;
				it != ListofRoad[var.P].end ( ) ;
				it++ , iu++ )
			{
				if ( vis[*it] == false )
				{
					if ( CostAns[source][*it] == -1 || ( CostAns[source][*it] > var.C + *( iu ) ) )
					{
						CostAns[source][*it] = var.C + *( iu ) ;
						pQ.push ( Node ( *it , CostAns[source][*it] ) ) ;
					}
				}
			}
		}
	}
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int a, b, time, cost, querys;
	int i, j, k, p, q, r, n, m;
	int times[100][100], costs[100][100];

	while (true) {
		cin >> n >> m;
		if (!n && !m)
			break;

		for (i = 0; i < m; i++) {
			for (j = 0; j < m; j++) {
				times[i][j] = (i == j) ? 0 : 1e9;
				costs[i][j] = (i == j) ? 0 : 1e9;
			}
		}

		for (i = 0; i < n; i++) {
			cin >> a >> b >> cost >> time;
			times[a - 1][b - 1] = time;
			costs[a - 1][b - 1] = cost;
		}

		for (k = 0; k < m; k++) {
			for (i = 0; i < m; i++) {
				for (j = 0; j < m; j++) {
					times[i][j] = min(times[i][j], times[i][k] + times[k][j]);
					costs[i][j] = min(costs[i][j], costs[i][k] + costs[k][j]);
				}
			}
		}

		cin >> querys;
		for (i = 0; i < querys; i++) {
			cin >> p >> q >> r;
			cout << (r ? times[p - 1][q - 1] : costs[p - 1][q - 1]) << endl;
		}
	}
}

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


const int INF = 1000000000;

int main()
{
	int n, m;
	while(cin >> n >> m){

		if(n==0 && m==0)
			break;

		int C[100][100];
		int T[100][100];
		for(int i=0; i<m; i++){
			for(int j=0; j<m; j++){
				if(i==j){
					C[i][j] = T[i][j] = 0;
				}
				else{
					C[i][j] = T[i][j] = INF;
				}
			}
		}

		for(int i=0; i<n; i++){
			int a, b, c, t;
			cin >> a >> b >> c >> t;

			C[a-1][b-1] = C[b-1][a-1] = c;
			T[a-1][b-1] = T[b-1][a-1] = t;
		}

		for(int k = 0;k < m ;k++){
			for(int i = 0;i < m;i++){
				for(int j = 0;j < m;j++){
					if(C[i][j] > C[i][k] + C[k][j]){
						C[i][j] = C[i][k] + C[k][j];
					}
					if(T[i][j] > T[i][k] + T[k][j]){
						T[i][j] = T[i][k] + T[k][j];
					}
				}
			}
		}
		int k;
		cin >> k;
		for(int i = 0;i < k;i++){
			int p,q,r;
			cin >> p >> q >> r;
			if(r == 0){
				cout << C[p-1][q-1] << endl;
			}else{
				cout << T[p-1][q-1] << endl;
			}
		}
	}
	return 0;
}