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 <bits/stdc++.h>
using namespace std;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(true){
        int n, m;
        cin >> n >> m;
        if(n == 0 and m == 0) break;

        int E[m][m], F[m][m];
        for(int i = 0; i < m; i++){
            for(int j = 0; j < m; j++){
                E[i][j] = (i == j ? 0 : 1e9);
                F[i][j] = (i == j ? 0 : 1e9);
            }
        }

        for(int i = 0; i < n; i++){
            int a, b, c1, c2;
            cin >> a >> b >> c1 >> c2;
            a--; b--;
            E[a][b] = c1;
            E[b][a] = c1;
            F[a][b] = c2;
            F[b][a] = c2;
        }

        for(int i = 0; i < m; i++){
            for(int j = 0; j < m; j++){
                for(int k = 0; k < m; k++){
                    E[j][k] = min(E[j][k], E[j][i] + E[i][k]);
                    F[j][k] = min(F[j][k], F[j][i] + F[i][k]);
                }
            }
        }

        int k;
        cin >> k;
        for(int i = 0; i < k; i++){
            int p, q, r;
            cin >> p >> q >> r;
            p--; q--;
            if(r == 0){
                cout << E[p][q] << endl;
            }else{
                cout << F[p][q] << endl;
            }
        }
    }

    return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
const int INF=(1<<21);
int main(){
  int road1[111][111];
  int road2[111][111];
  int n,m;
  int a,b,cost,time;
  int p,q,r;
  int x;
  while(1){
    cin >> n >> m;
    if(n==0 && m==0)break;
    for(int i=0;i<n;i++){
      for(int j=0;j<m;j++){
	road1[i][j]=road2[i][j]=INF;
      }
    }
    for(int i=0;i<n;i++){
      cin >> a >> b >> cost >> time;
      road1[a-1][b-1]=road1[b-1][a-1]=cost;
      road2[a-1][b-1]=road2[b-1][a-1]=time;
    }

    for(int k=0;k<n;k++){
      for(int i=0;i<n;i++){
	for(int j=0;j<n;j++){
	  road1[i][j]=min(road1[i][j],road1[i][k]+road1[k][j]);
	  road2[i][j]=min(road2[i][j],road2[i][k]+road2[k][j]);
	}
      }
    }
    
    cin >> x;
    for(int i=0;i<x;i++){
      cin >> p >> q >> r;
      cout << (r==0 ? road1[p-1][q-1] : road2[p-1][q-1]) << endl;
    }
  }
}

C++: #include<iostream>
#include<vector>
#include<cstring>
#define MINF 10000
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
struct E
{
    unsigned int a,b,c;
    E(){};
    E(unsigned int a,unsigned int b,unsigned int c):a(a),b(b),c(c){};
};
E cs[610];
E ts[610];

unsigned int d[1100];
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        if(n==0&&m==0)break;
        
        int a,b,c,t;
        rep(i,n)
        {
            cin>>a>>b>>c>>t;
            cs[i*2] = E(a,b,c);
            cs[i*2+1] = E(b,a,c);
            
            ts[i*2] = E(a,b,t);
            ts[i*2+1] = E(b,a,t);

        }
        int p,q,r,k;
        cin >> k;
        rep(i,k)
        {
            cin >> p >> q >> r;
            memset(d,MINF,sizeof(d));
            d[p] = 0;
            bool update = false;
            if(r == 0)
            {
                while(true)
                {
                    update = false;
                    rep(j,n*2)
                    {
                        if((d[ cs[j].b] != MINF) && d[cs[j].b] > d[cs[j].a] + cs[j].c )
                        {
                            d[cs[j].b] =  d[cs[j].a] + cs[j].c;
                            update = true;
                        }


                    }
                    if(!update) break;
                }
                cout << d[q] << endl;
            }
            else
            {
                while(true)
                {
                    update = false;
                    rep(j,n*2)
                    {
                        if(d[ ts[j].b] != MINF && d[ts[j].b] > d[ts[j].a] + ts[j].c)
                        {
                            d[ts[j].b] =  d[ts[j].a] + ts[j].c;
                            update = true;
                        }
                    }
                    if(!update) break;
                }
                cout << d[q] << endl;
            }
        }
    }
    return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 9999999
int dijkstra(int x,int y);
int D[128][128];/*Adjacency matrix*/
int n,m;
int main(){
	while(1){
		scanf("%d%d",&n,&m);
		if(n == 0 && m == 0)break;
		memset(D,0,sizeof(D));
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				if(i == j)continue;
				D[i][j] = INF;
			}
		}
		
		for(int i = 0; i < n; i++){
			int from,to,cst,tm;
			scanf("%d%d%d%d",&from,&to,&cst,&tm);
			D[from][to] = cst;
			D[to][from] = tm;
		}
		int k;
		scanf("%d",&k);
		for(int i = 0; i < k; i++){
			int from,to,x;
			scanf("%d%d%d",&from,&to,&x);
			(x == 0) ? printf("%d\n",dijkstra(from,to)) : printf("%d\n",dijkstra(to,from));
		}
	}
	return 0;
}
int dijkstra(int x,int y){
	int dist[128];
	bool done[128]={false};
	for(int i = 1; i <= m; i++){
		dist[i] = INF;
	}
	
	dist[x] = 0;
	int cost = 0;
	while(1){
		int e = -1;
		for(int i = 1; i <= m; i++){
			if(done[i] == false && (e == -1 || dist[i] < dist[e])){
				e = i;
			}
		}
		if(e == -1)break;
		done[e] = true;
		if(e == y){
			cost = dist[e];
			break;
		}
		
		for(int i = 1; i <= m; i++){
			dist[i] = min(dist[i],dist[e]+D[e][i]);
		}
		
	}
	
	if(cost == INF)return -1;
	else return cost;
}