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

using namespace std;

int date[101][101],prev[101][101],total[101];
vector<int> array[101];

void serch(int st,int now,int c_or_t)
{
//	cout << "start_serch:" << now << " nowsize:" << array[now].size() << endl;
	int i,flag=0;
	for(i=0;i<array[now].size();i++)
	{
		if(prev[now][array[now][i]]==1)
			flag++;
	}
	if(flag==array[now].size())
	{
		return ;
	}
	else if(c_or_t==0)
	{
		total[st]=0;
		for(i=0;i<array[now].size();i++)
		{
			if(prev[now][array[now][i]]!=1)
			{
				if(total[array[now][i]]>total[now]+date[now][array[now][i]])
				{
//					cout << "1:" << total[now]+date[now][array[now][i]] << " " << now << endl;
					total[array[now][i]]=total[now]+date[now][array[now][i]];
//					cout << "2:" << total[array[now][i]] << " " << array[now][i] << endl;
				}
			}
//			cout << "now:" << now << " next:" << array[now][i] << endl;
			prev[now][array[now][i]]=prev[array[now][i]][now]=1;
		}
		for(int j=0;j<array[now].size();j++)
		{
			serch(st,array[now][j],c_or_t);
		}
	}
	else if(c_or_t==1)
	{
		total[st]=0;
		for(i=0;i<array[now].size();i++)
		{
			if(prev[now][array[now][i]]!=1)
			{
//				cout << "in" << endl;
				if(total[array[now][i]]>total[now]+date[array[now][i]][now])
				{
//					cout << "1:" << total[now]+date[array[now][i]][now] << " " << now << endl;
					total[array[now][i]]=total[now]+date[array[now][i]][now];
//					cout << "2:" << total[array[now][i]] << " " << array[now][i] << endl;
				}
			}
//			cout << "now:" << now << " next:" << array[now][i] << endl;
			prev[now][array[now][i]]=prev[array[now][i]][now]=1;
		}
		for(int j=0;j<array[now].size();j++)
		{
			serch(st,array[now][j],c_or_t);
		}
	}
	return ;
}

int main()
{
	
	int n,m,i,j;
	
	for(;;)
	{
		cin >> n >> m ;
		if(n==0 && m==0)
			break;
		
		
		for(i=0;i<101;i++)
		{
			array[i].clear();
		}
		
		for(i=0;i<n;i++)
		{
			int a,b,cost,time;
			cin >> a >> b >> cost >> time ;
			array[a].push_back(b);
			array[b].push_back(a);
			date[a][b]=cost;
			date[b][a]=time;
		}
		
		int  num;
		cin >> num ;
		
		for(int k =0;k<num;k++)
		{
			int st,en,se;
			cin >> st >> en >> se ;
			for(i=0;i<m+1;i++)
			{
				total[i]=1000000;
				for(j=0;j<m+1;j++)
				{
					prev[i][j]=0;
				}
			}
			serch(st,st,se);
/*			for(int l=1;l<m+1;l++)
			{
				cout << total[l] << " " ;
			}
*/
			cout << total[en] << endl;
		}
	}
}

C++: // 2013/11/25 Tazoe

#include <iostream>
#include <algorithm>
using namespace std;

const int INF = 100000;

int main()
{
	while(true){
		int n, m;
		cin >> n >> m;

		if(n==0&&m==0)
			break;

		int C[100][100];
		int T[100][100];
		for(int i=0; i<m; i++){
			for(int j=0; j<m; j++){
				if(i==j){
					C[i][j] = T[i][j] = 0;
				}
				else{
					C[i][j] = T[i][j] = INF;
				}
			}
		}

		for(int i=0; i<n; i++){
			int a, b, c, t;
			cin >> a >> b >> c >> t;

			C[a-1][b-1] = C[b-1][a-1] = c;
			T[a-1][b-1] = T[b-1][a-1] = t;
		}

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

		int k;
		cin >> k;

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

			if(r==0){
				cout << C[p-1][q-1] << endl;
			}
			else{
				cout << T[p-1][q-1] << endl;
			}
		}
	}

	return 0;
}

C++: #include<iostream>

#define INF 1001;
using namespace std;


int main(){
  int n,m;
  while(1){
    cin>>n>>m;
    if(n==0&&m==0)break;
    int s_tim[m][m];
    int c_money[m][m];
    int a,b,cost,tim;

    for(int i=0;i<m;i++){
      for(int j=0;j<n;j++){
        s_tim[i][j]=INF;
        c_money[i][j]=INF;
      }
    }
    for(int i=0;i<m;i++){
      s_tim[i][i]=0;
      c_money[i][i]=0;
    }
    for(int i=0;i<n;i++){
      cin>>a>>b>>cost>>tim;
      s_tim[a-1][b-1]=tim;s_tim[b-1][a-1]=tim;
      c_money[a-1][b-1]=cost;c_money[b-1][a-1]=cost;
    }

    for(int k=0;k<m;k++){
      for(int i=0;i<m;i++){
        for(int j=0;j<m;j++){
          if(s_tim[i][j]>s_tim[i][k]+s_tim[k][j]){
            s_tim[i][j]=s_tim[i][k]+s_tim[k][j];
          }
          if(c_money[i][j]>c_money[i][k]+c_money[k][j]){
            c_money[i][j]=c_money[i][k]+c_money[k][j];
          }
        }
      }
    }

    int contacts,p,q,r;
    cin>>contacts;

    for(int i=0;i<contacts;i++){
      cin>>p>>q>>r;
      if(r){cout<<s_tim[p-1][q-1];}
      else{ cout<<c_money[p-1][q-1];}
      cout<<endl;
    }
  }
}

C++: #include<iostream>
using namespace std;
int main(){
  int n;//線路の情報の数
  int m;//駅の数
  int k;//問い合わせの数
  int cans = 0;//最小金額
  int tans = 0;//最短時間
  int c;
  while(cin>>n>>m){
    if(n==0&&m==0) break;
    int a[n],b[n];//駅の番号
    int cost[n],time[n];
    int dcost[m+1],dtime[m+1];
    for(int i=0;i<n;i++) cin >> a[i] >> b[i] >> cost[i] >> time[i];   
    cin >> k;
    int p[k],q[k],r[k];
    for(int i=0;i<k;i++){
      for(int j=0;j<=m;j++){
	dcost[j] = 0;
	dtime[j] = 0;
      }
      cin >> p[i] >> q[i] >> r[i];
      for(int j=p[i];j<=q[i];j++){
	for(int z=0;z<n;z++){
	  if(a[z]==j){
	    c = b[z];
	    if(cost[z]+dcost[j]<dcost[c]||dcost[c]==0){ 
	      dcost[c] = cost[z] + dcost[j];
	    }
	    if(time[z]+dtime[j]<dtime[c]||dtime[c]==0){
	      dtime[c] = time[z] + dtime[j];
	    }
	  }
	}
      }
      c = q[i];
      if(r[i]==0) cout << dcost[c] << endl;
      if(r[i]==1) cout << dtime[c] << endl;
    }
  }
    return 0;
}