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

int main(void){
    while(1){
        int n,m,k;
        cin >> n >> m;
        if(n == 0 && m == 0) break;

        int costs[m+1][m+1];
        int times[m+1][m+1];
        for(int i=0;i<m+1;i++){
            for(int j=0;j<m+1;j++){
                costs[i][j] = 1000000;
                times[i][j] = 1000000;
            }
        }

        for(int i =0;i<n;i++){
            int x,y,z,zz;
            cin >> x >> y >> z >> zz;
            costs[x][y] = z;
            times[x][y] = zz;
            costs[y][x] = z;
            times[y][x] = zz;
        }

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

        cin >> k;
        int p,q,r;
        for(int i = 0;i<k;i++){
            cin >> p >> q >> r;
            if (r == 1){
                cout << times[p][q] << "\n";
            }else{
                cout << costs[p][q] << "\n";
            }

        }
    }
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
using namespace std;

void dijkstra(int from, int mode);

pair<int, int> route[1000][1000];
int mini[1000];
int n, m;

int main()
{
	while (scanf("%d %d", &n, &m) * n != 0){
		fill(&route[0][0], &route[m - 1][m - 1], make_pair(0, 0));
		for (int i = 0; i < n; i++){
			int a, b;
			int cost, time;
			
			scanf("%d %d %d %d", &a, &b, &cost, &time);
			a--, b--;
			route[a][b] = make_pair(cost, time);
			route[b][a] = make_pair(cost, time);
		}
		
		int k;
		scanf("%d", &k);
		while (k-- > 0){
			fill(mini, mini + m, 100000000);
			int p, q, r;
			scanf("%d %d %d", &p, &q, &r);
			p--, q--;
			mini[p] = 0;
			dijkstra(p, r);
			printf("%d\n", mini[q]);
		}
	}
	
	return 0;
}

void dijkstra(int from, int mode)
{
	queue<int> to;
	
	for (int i = 0; i < m; i++){
		if (route[from][i].first + route[from][i].second == 0){
			continue;
		}
		if (mode == 0 && mini[i] > mini[from] + route[from][i].first){
			mini[i] = mini[from] + route[from][i].first;
			to.push(i);
		}
		else if (mode == 1 && mini[i] > mini[from] + route[from][i].second){
			mini[i] = mini[from] + route[from][i].second;
			to.push(i);
		}
	}
	while (!to.empty()){
		dijkstra(to.front(), mode);
		to.pop();
	}
}

C++: #include<cstdio>
#include<queue>
#define INF 100000000
using namespace std;
struct Root{
	int a,b;
	int cost,time;
}root[300];
int main(){
	int n,m;
	int k;
	int p,q,r;
	scanf("%d %d",&n,&m);
	while(n!=0&&m!=0){
		
		for(int i=0;i<n;i++){
			scanf("%d %d %d %d",&root[i].a,&root[i].b,&root[i].cost,&root[i].time);
		}
		scanf("%d",&k);

		for(int i=0;i<k;i++){
			scanf("%d %d %d",&p,&q,&r);
			priority_queue<int> pq;
			int station[100];
			for(int i2=0;i2<100;i2++){
				station[i2]=INF;
			}
			station[p-1]=0;
			pq.push(p);
			while(!pq.empty()){
				int point=pq.top();
				pq.pop();
				for(int i2=0;i2<n;i2++){
					
					if(r==0){
						if(point==root[i2].a&&root[i2].cost+station[point-1]<station[root[i2].b-1]){
							pq.push(root[i2].b);
							station[root[i2].b-1]=root[i2].cost+station[point-1];
						}
						if(point==root[i2].b&&root[i2].cost+station[point-1]<station[root[i2].a-1]){
							pq.push(root[i2].a);
							station[root[i2].b-1]=root[i2].cost+station[point-1];
						}
					}

					if(r==1){
						if(point==root[i2].a&&root[i2].time+station[point-1]<station[root[i2].b-1]){
							pq.push(root[i2].b);
							station[root[i2].b-1]=root[i2].time+station[point-1];
						}
						if(point==root[i2].b&&root[i2].time+station[point-1]<station[root[i2].a-1]){
							pq.push(root[i2].a);
							station[root[i2].b-1]=root[i2].time+station[point-1];
						}
					}

				}
			}
			printf("%d\n",station[q-1]);
		}
		scanf("%d %d",&n,&m);
	}
}

C++: #include<iostream>
#include<queue>
#include<algorithm>
#include<utility>
#include<vector>
#include<climits>
using namespace std;

#define MAX_M 110

struct edge{int to,cost;};
typedef pair<int,int> P;

vector<edge> c[2][MAX_M];

int dijkstra(int s,int e,bool r){
	int d[MAX_M];
	bool use[MAX_M];
	for(int i=0;i<MAX_M;i++){
		d[i]=INT_MAX;
		use[i]=0;
	}
	priority_queue<P,vector<P>,greater< P > > que;
	
	d[s]=0;
	
	que.push(P(0,s));
	int ans;
	while(!que.empty()){
		P p=que.top();que.pop();
		//cout<<"pop "<<p.second<<" "<<p.first<<endl;
		int v=p.second;
		if(v==e){
			ans=p.first;
			break;
		}
		
		if(use[v]) continue;
		use[v]=1;
		//cout<<"use "<<p.second<<" "<<p.first<<endl;
		for(int i=0;i<c[r][v].size();i++){
			edge e=c[r][v][i];
			if(d[e.to]>d[v]+e.cost){
				d[e.to]=d[v]+e.cost;
				que.push(P(d[e.to],e.to));
			}
		}
	}
	
	return d[e];
}

int main(){
	int n,m;
	while(cin>>n>>m,n!=0||m!=0){
		for(int r=0;r<2;r++){
			for(int i=0;i<MAX_M;i++){
				c[r][i].clear();
			}
		}
		for(int i=0;i<n;i++){
			int a,b,cos,tim;
			cin>>a>>b>>cos>>tim;
			edge co,t;
			co.to=b;co.cost=cos;
			t.to=b;t.cost=tim;
			c[0][a].push_back(co);
			c[1][a].push_back(t);
			co.to=a;t.to=a;
			c[0][b].push_back(co);
			c[1][b].push_back(t);
		}
		int k;
		cin>>k;
		for(int i=0;i<k;i++){
			int s,e;
			bool r;
			cin>>s>>e>>r;
			int ans=dijkstra(s,e,r);
			cout<<ans<<endl;
		}
	}
}