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
			c_matrix[b-1][a-1] = c
			t_matrix[a-1][b-1] = t
			t_matrix[b-1][a-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<iostream>
#include<cstring>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define INF 300000

struct E
{
    int a,b,c,t;
    E(){};
    E(int a,int b,int c,int t):a(a),b(b),c(c),t(t){};
};
//E cs[700];
unsigned int d[150];

int main()
{
    int n,m,k,p,q,r;
    while(cin >> n >> m)
    {
        if(n==0 && m==0)break;
        vector<E> cs;   
        int ta,tb,tc,tt;
        rep(i,n)
        {
            cin >> ta>>tb>>tc >>tt;
            cs.push_back =( E(ta,tb,tc,tt));
            cs.push_back( E(tb,ta,tc,tt));
        }

        cin >> k;
        rep(i,k)
        {
            memset(d,INF,150*sizeof(int));
            cin >> p >> q >>r;
            d[p] = 0;

            bool update = false;
            if(r==0)while(true)
            {
                update = false;
                rep(j,m*2)
                {
                   if(d[cs[j].a] != INF && d[cs[j].b] > d[cs[j].a] + cs[j].c)
                   {
                       update = true;
                       d[cs[j].b] =  d[cs[j].a] + cs[j].c;
                   }
                }
                if(!update) break;
            }
            if(r==1)while(true)
            {
                update = false;
                rep(j,m*2)
                {
                   if(d[cs[j].a] != INF && d[cs[j].b] > d[cs[j].a] + cs[j].t)
                   {
                       update = true;
                       d[cs[j].b] =  d[cs[j].a] + cs[j].t;
                   }
                }
                if(!update) break;
            }
            cout << d[q] << endl;
        }
        
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

#define INF 1<<25

int main(){
  int cost[101][101];
  int times[101][101];
  int n,m;
  int a,b,c,t;
  while(cin>>n>>m,n|m){
    for(int i=0;i<101;i++){
      for(int j=0;j<101;j++){
	cost[i][j]=times[i][j]=INF;
      }
    }
    for(int i=0;i<n;i++){
      cin>>a>>b>>c>>t;
      cost[a][b]=cost[b][a]=c;
      times[a][b]=times[b][a]=t;
    }
    for(int i=1;i<=m;i++){
      for(int j=1;j<=m;j++){
	for(int k=1;k<=m;k++){
	  cost[j][k]=min(cost[j][k],cost[j][i]+cost[i][k]);
	  times[j][k]=min(times[j][k],times[j][i]+times[i][k]);
	}
      }
    }
    int k,p,q,r;
    cin>>k;
    for(int i=0;i<k;i++){
      cin>>p>>q>>r;
      cout<<(r==0 ? cost[p][q] : times[p][q] ) <<endl;
    }
  }
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#define INF (1<<30)
#define COST 0
#define TIME 1

using namespace std;

typedef pair<int, int> p;

vector<p> costs[105], times[105];
int dist[105];
void dijkstra(vector<p> *edge, int s){
	fill(dist, dist + 105, INF);
	dist[s] = 0;
	priority_queue<p, vector<p>, greater<p> > q;
	q.push(p(0, s));
	while(!q.empty()){
		p tmp = q.top();q.pop();
		int d = tmp.first, from = tmp.second;
		if(dist[from] < d)continue;		
		for(int i = 0; i < edge[from].size(); i++){
			int to = edge[from][i].first, c = edge[from][i].second;
			if(dist[to] < dist[from] + c)continue;
			dist[to] = dist[from] + c;
			q.push(p(dist[to], to));
		}
	}
}

int main(){
	while(true){
		int n, m;
		cin >> n >> m;
		if(!n && !m)
			break;
		for(int i = 0; i < 105; i++){
			costs[i].clear();
			times[i].clear();
		}
		for(int i = 0; i < n; i++){
			int a, b, c, t;
			cin >> a >> b >> c >> t;
			costs[a].push_back(p(b, c));
			costs[b].push_back(p(a, c));
			times[a].push_back(p(b, t));
			times[b].push_back(p(a, t));
		}
		int k;
		cin >> k;
		for(int i = 0; i < k; i++){
			int p, q, r;
			cin >> p >> q >> r;
			if(r == COST){
				dijkstra(costs, p);
			}else{
				dijkstra(times, p);
			}
			cout << dist[q] << endl;
		}
	}
	return 0;
}

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

#define INF 100000000

using namespace std;

int main()
{
    int n, m;
    while(cin >> n >> m) {
        if(n == 0 && m == 0) break;
        int times[n+1][n+1], costs[n+1][n+1];
        int a,b,cost,time;
        for(int i = 1; i <= n; i++) 
            for(int j = 1; j <= n; j++) 
                times[i][j] = costs[i][j] = (i==j) ? 0 : INF; 
        
        for(int i = 0; i < n; i++) {
            cin >> a >> b >> cost >> time;
            costs[a][b] = costs[b][a] = cost;
            times[a][b] = times[b][a] = time;
        }

        for(int a = 1; a <= n; a++) {
            for(int b = 1; b <= n; b++) {
                for(int c = 1; c <= n; c++) {
                    times[a][b] = min(times[a][b], times[a][c] + times[c][b]);
                    costs[a][b] = min(costs[a][b], costs[a][c] + costs[c][b]);
                }
            }
        }

        int p,q,r,qn;
        cin >> qn;
        for(int i = 0; i < qn; i++) {
            cin >> p >> q >> r;
            if(r == 1) 
                cout << times[p][q] << endl;
            else 
                cout << costs[p][q] << endl;
                     
        }
    }
    return 0;
}