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 <algorithm>
using namespace std;
const int INF = 1000000;
int cost[301][301],time[301][301];
int main(){
	int n,m;
	while(cin >> n >> m && (n != 0 || m != 0)){
		int a,b,icost,itime,c,r;
		for(int i = 0;i <= m;++i){
			for(int j = 0;j <= m;++j){
				if(i == j) {
					cost[i][i] = 0;
					time[i][i] = 0;
				}
				else {
					cost[i][j] = INF;
					time[i][j] = INF;
				}
			}
		}
		for(int i = 0;i < n;++i){
			cin >> a >> b >> icost >> itime;
			cost[a][b] = cost[b][a] = icost;
			time[a][b] = time[b][a] = itime;
		}
		cin >> c;
		for(int i = 0;i < c;++i){
			cin >> a >> b >> r;
			for(int k = 0;k <= m;++k){
				for(int i = 0;i <= m;++i){
					for(int j = 0;j <= m;++j){
						if(r == 1) time[i][j] = min(time[i][j],time[i][k] + time[k][j]);
						else cost[i][j] = min(cost[i][j],cost[i][k] + cost[k][j]);
					}
				}
			}
			if(r == 1) cout << time[a][b] << endl;
			else cout << cost[a][b] << endl;
		}
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int n,m;
  int a,b,c,d;
  int x;
  int p,q,r;
  int cost[111][111];
  int time[111][111];
  while(1){
    cin >> n >> m;
    if(n==0 && m==0)break;
    for(int i=0;i<111;i++){
      for(int j=0;j<111;j++){
	cost[i][j]=9999999;
	time[i][j]=9999999;
      }
    }
    for(int i=0;i<n;i++){
      cin >> a >> b >> c >> d;
      cost[a-1][b-1]=cost[b-1][a-1]=c;
      time[a-1][b-1]=time[b-1][a-1]=d;
    }
    for(int k=0;k<m;k++){
      for(int i=0;i<m;i++){
	for(int j=0;j<m;j++){
	  cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);
	  time[i][j]=min(time[i][j],time[i][k]+time[k][j]);
	}
      }
    }
    cin >> x;
    for(int i=0;i<x;i++){
      cin >> p >> q >> r;
      cout << (r==0 ? cost[p-1][q-1] : time[p-1][q-1]) << endl;
    }
  }
}

C++: #include <iostream>
#include <queue>
#include <functional>
#include <map>
#include <vector>

using namespace std;

const int INF = 9999999;

int solve( int from, int to, int cost[101][101], int n )
{
	int dist[101];
	int history[101];

	for( int i = 0;i < 101;i++ ){
		dist[i] = INF;
		history[i] = 0;
	}

	dist[from] = 0;

	priority_queue<pair<int,int>,vector< pair<int,int> >,greater< pair<int,int> > > q;
	q.push( make_pair(0,from) );

	while( !q.empty() ){
		pair<int,int> a = q.top();
		int u = a.second;
		history[u] = 1;
		q.pop();

		for( int i = 1;i <= n;i++ ){
			if( history[i] ) continue;
			if( cost[u][i] == INF ) continue;

			if( dist[i] > cost[u][i] + dist[u] ){
				dist[i] = cost[u][i] + dist[u];
				q.push( make_pair(dist[i],i ) );
			}
		}
	}
	return dist[to];
}

int main(void){
	int n,m;
	int cost[101][101];
	int time[101][101];

	while( cin >> n >> m && n != 0 ){
		for( int i = 0;i < 101;i++ ){
			for( int j = 0;j < 101;j++ ){
				cost[i][j] = INF;
				time[i][j] = INF;
			}
		}
		for( int i = 0;i < 101;i++ ){
			cost[i][i] = 0;
			time[i][i] = 0;
		}
		for( int i = 0;i < n;i++ ){
			int a,b,c,d;
			cin >> a >> b >> c >> d;
			cost[a][b] = c;
			cost[b][a] = c;
			time[a][b] = d;
			time[b][a] = d;
		}

		int k;
		cin >> k;

		for( int i = 0;i < k;i++ ){
			int p,q,r;
			cin >> p >> q >> r;

			cout << solve( p, q, r ? time : cost, n ) << 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;
		IsSelected = false;
	}
	void Reset(){
		Lowest = 2147483647;
		IsSelected = false;
	}
};
struct AboutTo{
	Node* To;
	int Cost;
	int Time;
};

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

int main(){
	while (true){
	int n, m;
	cin >> n >> m;
	if (n == 0 && m == 0)break;
		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 });
		}
		/*
		12 9
		1 2 5 5
		2 3 4 4
		3 6 3 10
		6 9 1 1
		9 8 7 6
		8 7 4 3
		7 4 2 1
		4 1 10 14
		2 5 7 8
		5 8 9 10
		4 5 9 9
		5 6 10 1
		*/
		int k;
		cin >> k;
		for (int i = 0; i < k; ++i){
			int p, q, r;
			cin >> p >> q >> r;
			NodeCollection[p - 1].Lowest = 0;
			if (p == q){cout << 0 << endl;
			}
			else{
				cout << GetShortest(p - 1, NodeCollection[q - 1], NodeCollection, r) << endl;
			}
			for (auto i = NodeCollection.begin(); i != NodeCollection.end(); ++i){
				(*i).Reset();
			}
		}
		
	}
	return 0;
}