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>
#define INF 10e6

using namespace std;

int main(void) {
	int n,m,k,p,q,r;
	while (cin >> n >> m && n && m) {
		int dp[101][101][2];
		for (int i = 0; i < m + 1; ++i) {
			for (int j = 0; j < m + 1; ++j) {
				for (int k = 0; k < 1; ++k) {
					if (i != j) {
						dp[i][j][k] = INF;
					}
					else {
						dp[i][j][k] = 0;
					}
				}
			}
		}

		int a,b;
		for (int i = 0; i < n; ++i) {
			cin >> a >> b >> dp[a][b][0] >> dp[a][b][1];
			dp[b][a][0] = dp[a][b][0];
			dp[b][a][1] = dp[a][b][1];
		}

		for (int mode = 0; mode < 2; ++mode) {
			for (int k = 1; k < m + 1; ++k) {
				for (int i = 1; i < m + 1; ++i) {
					for (int j = 1; j < m + 1; ++j) {
						dp[i][j][mode] = min(dp[i][j][mode], dp[i][k][mode]+dp[k][j][mode]);
					}
				}
			}
		}

		cin >> k;
		for (int i = 0; i < k; ++i) {
			cin >> p >> q >> r;
			cout << dp[p][q][r] << endl;
		}
	}
	return 0;
}

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

bool open(int max[101],int name[101][101][2],int m,int basic,int r)
{
	int i;
	bool F5=false;
	for(i=1;i<=m;i++)
	{
		if(basic == i)
			continue;
		if(name[basic][i][r] != 0)
		{
			if(max[i] == -1)
			{
				max[i] = name[basic][i][r] + max[basic];
				if(F5 == false)
					F5 = true;
			}
			else if(max[i] > name[basic][i][r] + max[basic])
			{
				max[i] = name[basic][i][r] + max[basic];
				if(F5 == false)
					F5 = true;
			}
		}
	}
	return F5;
}

int main(void)
{
	while(1)
	{
		int n,m;
		int a,b,cost,time;
		int k;
		int p,q,r;
		int mintime;
		int mincost;
		int i,j,x,y;
		bool F5;

		int name[101][101][2] = {};//OÍ¿à
		int max[101]={};

		for(i=0;i<100;i++)
		{
			max[i] = 1001;
		}

		cin >> n >> m;

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

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

		}

		cin >> k;

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

			for(j=0;j<100;j++)
			{
				max[j] = -1;
			}

			max[p] = 0;

			while(F5 == true)
			{
				F5 = false;
				for(x=1;x<=n;x++)
				{
					if(open(max,name,m,x,r) == true)
					{
						if(F5 == false)
						{
							F5 = true;
						}
					}
				}
			}
			cout << max[q] << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
#define MAX 10000000
#define MAX_ST 101 //MAX_STATION
#define LP(i,n) for(int i=0;i<n;i++)
class Node{
public:
	int at;
	int cost;
	Node(int a,int c){
		at=a;cost=c;
	}
	bool operator < (const Node &o) const{
		return cost>o.cost;
	}
};
int feeMap[MAX_ST][MAX_ST];
int timeMap[MAX_ST][MAX_ST];
bool visited[MAX_ST][MAX_ST];
typedef priority_queue<Node> PQ;

int dijkstra(int st,int ed,int n,int judge){
	PQ pq;
	pq.push(Node(st,0));
	while(!pq.empty()){
		Node cur=pq.top();pq.pop();
		if(cur.at==ed)return cur.cost;
//		cout<<"now:"<<cur.at<<endl;
		for(int i=1;i<=n;i++){
			if((judge&&timeMap[cur.at][i]==MAX)||(!judge&&feeMap[cur.at][i]==MAX)||cur.at==i)continue;
//			cout<<"    next:"<<i<<endl;
			int cost=judge?timeMap[cur.at][i]:feeMap[cur.at][i];
			pq.push(Node(i,cur.cost+cost));
		}
	}
	cout<<"not found"<<endl;
	return MAX;
}

void init(){
	LP(i,MAX_ST)LP(j,MAX_ST){feeMap[i][j]=timeMap[i][j]=MAX;visited[i][j]=true;}
}
void printMap(int n){
	LP(i,n){LP(j,n)printf("%8d",feeMap[i][j]!=MAX?feeMap[i][j]:-1);cout<<endl;}
	cout<<"---------------------------------------------------------"<<endl;
	LP(i,n){LP(j,n)printf("%8d",timeMap[i][j]!=MAX?timeMap[i][j]:-1);cout<<endl;}
}
int main(){
	int n,m;
	while(cin>>n>>m&&(n||m)){
		init();
		int _n=n;
		//ツ静シツ路ツ湘ョツ陛ア
		for(int a,b,cost,time;n--&&cin>>a>>b>>cost>>time;){
			if(feeMap[a][b]>cost)feeMap[a][b]=feeMap[b][a]=cost;
			if(timeMap[a][b]>time)timeMap[a][b]=timeMap[b][a]=time;
		}
		//printMap(_n);
		int d;
		cin>>d;
		//ツ姪「ツつ「ツ債づュツつケ
		for(int p,q,r;d--&&cin>>p>>q>>r;){
			cout<<dijkstra(p,q,_n,r)<<endl;
		}
	}
	return 0;
}

C++: #include<queue>
#include<cstdio>
#include<algorithm>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

template<class T>
class d_heap{
	static const int N_MAX=3000; // !!
	int n,d;
	T a[N_MAX];
public:
	d_heap(int d):n(0),d(d){}
	const T &find_min()const{ return a[0]; }
	void insert(const T &x){
		int u=n++;
		a[u]=x;
		while(u!=0 && a[(u-1)/d]>a[u]) swap(a[(u-1)/d],a[u]), u=(u-1)/d;
	}
	void delete_min(){
		a[0]=a[--n];
		for(int u=0;;){
			int v=u;
			for(int w=d*u+1;w<=d*u+d;w++) if(w<n && a[v]>a[w]) v=w;
			if(v==u) break;
			swap(a[v],a[u]);
			u=v;
		}
	}
	bool empty()const{ return n==0; }
	int size()const{ return n; }
};

#define define_heap d_heap< pair<int,int> > H(30);

const int INF=1<<29;

struct edge{ int v,cost1,cost2; };

int main(){
	for(int m,n;scanf("%d%d",&m,&n),n;){
		vector<edge> G[100];
		rep(i,m){
			int u,v,cost1,cost2; scanf("%d%d%d%d",&u,&v,&cost1,&cost2); u--; v--;
			G[u].push_back((edge){v,cost1,cost2});
			G[v].push_back((edge){u,cost1,cost2});
		}

		int q; scanf("%d",&q);
		while(q--){
			int s,t,type; scanf("%d%d%d",&s,&t,&type); s--; t--;

			int d[100];
			rep(u,n) d[u]=(u==s?0:INF);
			define_heap;
			H.insert(make_pair(0,s));
			while(!H.empty()){
				int d_now=H.find_min().first,u=H.find_min().second;
				H.delete_min();

				if(d[u]<d_now) continue;

				rep(i,G[u].size()){
					const edge &e=G[u][i];
					int d2=d_now+(type==0?e.cost1:e.cost2);
					if(d[e.v]>d2){
						d[e.v]=d2;
						H.insert(make_pair(d2,e.v));
					}
				}
			}

			printf("%d\n",d[t]);
		}
	}

	return 0;
}