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

const int INF = 2000;

struct LineTable{
  int cost;
  int times;
  LineTable(){
    cost = INF;
    times = INF;
  }
};

int main(){

    int n,m;
    while(1){
      cin >> n >> m;
      if(n==0&&m==0){
        break;
      }
      LineTable table[m][m];

      for(int i=0;i<n;i++){
        int a,b,cost,times;
        cin >> a >> b >> cost >> times;
        table[a-1][b-1].cost = cost;
        table[a-1][b-1].times = times;
      }

      for(int k=0;k<m;k++){
        for(int i=0;i<m;i++){
          for(int j=0;j<m;j++){
            if(table[i][j].cost > table[i][k].cost + table[k][j].cost){
              table[i][j].cost = table[i][k].cost + table[k][j].cost;
            }
          }
        }
      }

      for(int k=0;k<m;k++){
        for(int i=0;i<m;i++){
          for(int j=0;j<m;j++){
            if(table[i][j].times > table[i][k].times + table[k][j].times){
              table[i][j].times = table[i][k].times + table[k][j].times;
            }
          }
        }
      }

      int k,p,q,r;
      cin >> k;
      cin >> p >> q >> r;
      if(r==0){
        cout << table[p-1][q-1].cost;
      }
      else{
        cout << table[p-1][q-1].times;
      }
      for(int i=1;i<k;i++){
        cin >> p >> q >> r;
        if(r==0){
          cout << ' ' <<table[p-1][q-1].cost;
        }
        else{
          cout << ' ' <<table[p-1][q-1].times;
        }
      }
      cout << endl;
    }
    return 0;
}

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

using namespace std;

#define chmin(a,b) a=min(a,b)
#define rep(i,x) for(int i=0;i<(x);++i)

const int inf = 1e9;

int N, M;
int mc[100][100], mt[100][100];

int main()
{
    while (scanf("%d %d", &N, &M), N || M) {
        fill(mc[0], mc[M], inf);
        fill(mt[0], mt[M], inf);

        rep(i, M) mc[i][i] = mt[i][i] = 0;

        rep(i, N) {
            int a, b, cost, time; scanf("%d %d %d %d", &a, &b, &cost, &time); a--; b--;
            mc[a][b] = mc[b][a] = cost;
            mt[a][b] = mt[b][a] = time;
        }

        rep(k, M) rep(i, M) rep(j, M) {
            chmin(mc[i][j], mc[i][k] + mc[j][k]);
            chmin(mt[i][j], mt[i][k] + mt[j][k]);
        }

        int K; scanf("%d", &K);
        rep(i, K) {
            int p, q, r; scanf("%d %d %d", &p, &q, &r); p--; q--;
            printf("%d\n", r == 0 ? mc[p][q] : mt[p][q]);
        }
    }
}

C++: #include <bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) begin(a),end(a)
#define MS(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
const ll INF = 114514810;
const ll MOD = 1000000007;
const double EPS = 1e-8;
const double PI = acos(-1.0);
struct edge
{
	int from, to, cost;
	bool operator < (const edge& e) const { return cost < e.cost; }
	bool operator >(const edge& e) const { return cost > e.cost; }
};
int dx[] = { -1, 0, 0, 1 }; int dy[] = { 0, -1, 1, 0 };
bool valid(int x, int y, int h, int w) { return (x >= 0 && y >= 0 && x < h&&y < w); }
///*************************************************************************************///
///*************************************************************************************///
///*************************************************************************************///


int main()
{
	int n, m;
	while (cin >> n >> m, n)
	{
		int tim[101][101], cos[101][101];
		REP(i, m)REP(j, m) tim[i][j] = (i == j ? 0 : INF);
		REP(i, m)REP(j, m) cos[i][j] = (i == j ? 0 : INF);
		while (n--)
		{
			int a, b, c, d;
			cin >> a >> b >> c >> d;
			a--; b--;
			tim[a][b] = tim[b][a] = c;
			cos[a][b] = cos[b][a] = d;
		}
		REP(k, m)REP(i, m)REP(j, m) tim[i][j] = min(tim[i][j], tim[i][k] + tim[k][j]);
		REP(k, m)REP(i, m)REP(j, m) cos[i][j] = min(cos[i][j], cos[i][k] + cos[k][j]);
		int q;
		cin >> q;
		while (q--)
		{
			int a, b, c;
			cin >> a >> b >> c;
			a--; b--;
			cout << (c == 0 ? tim[a][b] : cos[a][b]) << endl;
		}
	}
}

C++: #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>

const int INF = 1000000;

using Mat = std::vector< std::vector<int> >;

void wf(Mat& adj_mat) {
  int n = adj_mat.size();

  for(int i = 0; i < n; ++i) {     // via node
    for(int j = 0; j < n; ++j) {   // start
      for(int k = 0; k < n; ++k) { // terminal
        adj_mat[j][k] = std::min(adj_mat[j][k], adj_mat[j][i] + adj_mat[i][k]);
      }
    }
  }
}

int main() {
  int n, m;
  int a, b, cost, time;

  std::cin >> n >> m;
  Mat cost_table, time_table;
  cost_table.resize(m);
  time_table.resize(m);
  for(int i = 0; i < m; ++i) {
    cost_table.at(i).resize(m);
    time_table.at(i).resize(m);
    for(int j = 0; j < m; ++j){
      cost_table[i][j] = INF;
      time_table[i][j] = INF;
    }
  }

  for(int i = 0; i < n; ++i){
    std::cin >> a >> b >> cost >> time;
    --a, --b;
    cost_table[a][b] = cost_table[b][a] = cost;
    time_table[a][b] = time_table[b][a] = time;
  }

  wf(cost_table);
  wf(time_table);

  // Query
  int k;
  int p, q, r;
  std::cin >> k;
  for(int i = 0; i < k; ++i){
    std::cin >> p >> q >> r;
    --p, --q;
    if (r == 0)
      std::cout << cost_table[p][q] << std::endl;
    else
      std::cout << time_table[p][q] << std::endl;

  }
}