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 <vector>

using namespace std;

 

#define INF 200000000

 

int main()

{

    int e, n, k;

    int a, b, cost, time, r;

    while(cin >> e >> n && e && n)

    {

        vector<vector<int> > costs(n+1, vector<int>(n+1, INF)),

                            times(n+1, vector<int>(n+1, INF));

        for(int i=0; i<costs.size(); i++)

        {

            costs[i][i] = 0;

            times[i][i] = 0;

        }

 

        for(int i=0; i<e; i++)

        {

            cin >> a >> b >> cost >> time;

            costs[a][b] = cost;

            costs[b][a] = cost;

            times[a][b] = time;

            times[b][a] = time;

        }

 

        cin >> k;

        for(int q=0; q<k; q++)

        {

            cin >> a >> b >> r;

            vector<vector<int> > v;

            if(r == 0) v = costs;

            else v = times;

 

            vector<int> distance(n+1, INF); distance[a] = 0;

            vector<int> reached(n+1, 0);

 

            while(true)

            {

                int im = -1;

                for(int i=0; i<reached.size(); i++) if(reached[i] == 0)

                {

                    if(im == -1 || distance[i] < distance[im]) im = i;

                }

                if(im == b) { cout << distance[im] << endl; break; }

 

                reached[im] = 1;

               for(int j=0; j<v[im].size(); j++)

                {

                    if(distance[im] + v[im][j] < distance[j])

                        distance[j] = distance[im] + v[im][j];

                }

            }

        }

    }

    return 0;
}

C++: #include <iostream>
#include <algorithm>
#define MAX 2000
#define INF 999999

using namespace std;

int COST[MAX + 1][MAX + 1];
int TIME[MAX + 1][MAX + 1];
int v[MAX + 1];
bool visit[MAX + 1];
int n,m,k,p,q,r,ti,co;
int from,too;
int MI,mi;

int get_time(void){ // ダイクストラ法

  for( int i = 0 ; i <= MAX ; i++ ){ // 初期化
    visit[i] = false;
    v[i] = INF;
  }


  v[p] = 0; // 最初の位置を0にする

  while(1){

    mi = INF;

    for( int i = 1 ; i <= m ; i++ ){ // 訪れていない最小時間とその添字を求める
      if( !visit[i] && v[i] < mi ){
	MI = i;
	mi = v[i];
      }
    }

    if( mi == INF ) break;
    visit[MI] = true; // 訪れたことにする

    for( int i = 1 ; i <= m ; i++ ){
      if( TIME[MI][i] + v[MI] < v[i] ){
	v[i] = TIME[MI][i] + v[MI];
      }
    }
  }
  return v[q];
}

int get_cost(void){

  for( int i = 0 ; i <= MAX ; i++ ){
    v[i] = INF;
    visit[i] = false;
  }

  v[p] = 0; 

  while(1){

    mi = INF;

    for( int i = 1 ; i <= m ; i++ ){
      if( !visit[i] && v[i] < mi ){
	MI = i;
	mi = v[i];
      }
    }

    if( mi == INF ) break;
    visit[MI] = true;

    for( int i = 1 ; i <= m ; i++ ){
      if( COST[MI][i] + v[MI] < v[i] ){
	v[i] = COST[MI][i] + v[MI];
      }
    }
  }
  return v[q];
}



int main(void){

  while( cin >> n >> m , n || m ){

    for( int i = 0 ; i <= MAX ; i++ ){
      for( int j = 0 ; j <= MAX ; j++ ){ // 初期化
	TIME[i][j] = INF;
	COST[i][j] = INF;
      }
    }

    for( int i = 0 ; i < n ; i++ ){
      cin >> from >> too >> co >> ti;
      COST[from][too] = COST[too][from] = co;
      TIME[from][too] = TIME[too][from] = ti;
    }

    cin >> k; // 問い合わせの数

    for( int i = 0 ; i < k ; i++ ){
      cin >> p >> q >> r;

      switch(r){
      case 0: // 最小金額
	cout << get_cost() << endl;
	break;
      case 1: // 最小時間
	cout << get_time() << endl;
      }

    }

  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#define INF 1<<29
??
using namespace std;
??
int main(void) {
????????int n,m,k,p,q,r;
????????while (cin >> n >> m && n && m) {
????????????????int dp[101][101][2];
????????????????for (int i = 0; i < m + 1; ++i) {
????????????????????????for (int j = 0; j < m + 1; ++j) {
????????????????????????????????for (int k = 0; k < 2; ++k) {
????????????????????????????????????????if (i == j) {
????????????????????????????????????????????????dp[i][j][k] = 0;
????????????????????????????????????????}
????????????????????????????????????????else {
????????????????????????????????????????????????dp[i][j][k] = INF;
????????????????????????????????????????}
????????????????????????????????}
????????????????????????}
????????????????}
??
????????????????int a,b,c,t;
????????????????for (int i = 0; i < n; ++i) {
????????????????????????cin >> a >> b >> dp[a][b][0] >> dp[a][b][1];
????????????????????????dp[b][a][0] = dp[a][b][0];
????????????????????????dp[b][a][1] = dp[a][b][1];
????????????????}
??
????????????????for (int mode = 0; mode < 2; ++mode) {
????????????????????????for (int k = 1; k < m + 1; ++k) {
????????????????????????????????for (int i = 1; i < m + 1; ++i) {
????????????????????????????????????????for (int j = 1; j < m + 1; ++j) {
????????????????????????????????????????????????dp[i][j][mode] = min(dp[i][j][mode], dp[i][k][mode]+dp[k][j][mode]);
????????????????????????????????????????}
????????????????????????????????}
????????????????????????}
????????????????}
??
????????????????cin >> k;
????????????????for (int i = 0; i < k; ++i) {
????????????????????????cin >> p >> q >> r;
????????????????????????cout << dp[p][q][r] << endl;
????????????????}
????????}
????????return 0;
}