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 <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] = 1001;
                times[i][j] = 1001;
            }
        }

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

const int INF = 1000000;
const int MAX_V = 101;
const int MAX_E = 20000;

int cost[MAX_V][MAX_V];
int time[MAX_V][MAX_V];
int d[MAX_V];
bool used[MAX_V];
int V;

int n,m;

void dijkstra(int s,bool r){
    fill(d,d+m,INF);
    memset(used,false,sizeof(used));
    d[s]=0;
    while(1){
        int v=-1;
        for(int u=0;u<m;u++){
            if(used[u]) continue;
            if(v==-1||d[u]<d[v]){
                v=u;
            }
        }
        if(v==-1) break;
        used[v]=true;
        for(int u=0;u<m;u++){
            int c;
            if(r) c=cost[u][v];
            else c=time[u][v];
            d[u]=min(d[u],d[v]+c);
        }
    }
}
int main(){
    while(cin >> n >> m,n+m){
        for(int i=0;i<m+1; i++){
            for(int j=0; j<m; j++){
                cost[i][j]=INF;
                time[i][j]=INF;
            }
        }
        for (int i = 0; i < m+1; ++i) {
            cost[i][i]=0;
            time[i][i]=0;
        }
        for (int i = 0; i < n; ++i) {
            int to,from,c,t;
            cin >> to>>from>>c>>t;
            to--; from--;
            cost[to][from]=c;
            cost[from][to]=c;
            time[to][from]=t;
            time[from][to]=t;
        }
        int k; cin>>k;
        for (int i = 0; i < k; ++i) {
            int p,q,r;
            cin>>p>>q>>r;
            p--; q--;
            dijkstra(p,!r);
            cout<<d[q]<<endl;
        }
    }
}

C++: #include<bits/stdc++.h>
#define ll long long int
#define FOR(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)
#define MIN(a, b) ((a)<(b)?(a):(b))
#define INF 10e6
using namespace std;
 /*temp*/

int main(){
    int n, m, l;
    while(cin>>m>>n,n){
        int cost[n][n],time[n][n];
        // set table
        REP(i,n){
            REP(j,n){
                cost[i][j]=time[i][j]=INF;
            }
            cost[i][i]=time[i][i]=0;
        }
        // read
        REP(i,n){
            int a,b,c,t;
            a--;
            b--;
            cost[a][b]=cost[b][a]=MIN(c,cost[a][b]);
            time[a][b]=time[b][a]=MIN(t,time[a][b]);
        }
        // Warshall???Floyd Algorithm
        REP(a,n){
            REP(b,a+1){
                REP(k,n){
                    cost[a][b]=cost[b][a]=MIN(cost[a][b],cost[a][k]+cost[k][b]);
                    time[a][b]=time[b][a]=MIN(time[a][b],time[a][k]+time[k][b]);
                }
            }
        }
        // 
        int q;
        cin>>q;
        REP(i,q){
            int s,d,type;
            cin>>s>>d>>type;
            s--;
            d--;
            cout<<type==0?cost[s][d]:time[s][d]<<'\n';
        }
    }
    return 0;
}