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>

#define N 100
using namespace std;
const int infty = 1<<27;

int main()
{
  while(true){
    int n,m;
    cin >> n >> m;
    if( n == 0 && m == 0 )break;
    
    int gcost[N][N];
    int gtime[N][N];
    
    fill( &gcost[0][0], &gcost[N-1][N-1], infty );
    fill( &gtime[0][0], &gtime[N-1][N-1], infty );
    
    for(int i = 0; i < n; ++i){
      int a,b,cost,time;
      
      cin >> a >> b >> cost >> time;
      --a;--b;
      gcost[a][b] = gcost[b][a] = cost;
      gtime[a][b] = gtime[b][a] = time;
    }
  
    for(int k = 0; k < m; ++k){
      for(int i = 0; i < m; ++i){
	for(int j = 0; j < m; ++j){
	  gcost[i][j] = min( gcost[i][j], gcost[i][k]+gcost[k][j] );
	  gtime[i][j] = min( gtime[i][j], gtime[i][k]+gtime[k][j] );
	}
      }
    }
    
    int Q;
    cin >> Q;
    for(int i = 0; i < Q; ++i){
      int st,ed,r;
      cin >> st >> ed >> r;
      --st;--ed;
      if( r == 0 ){
	cout << gcost[st][ed] << endl;
      }else{
	cout << gtime[st][ed] << endl;
      }
    }    
  }

  return 0;
}

C++: #include <iostream>
using namespace std;

const int INF = 1000000000;

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;
		}

		int N,p,q,r;
		int dt[100][100];
		int dc[100][100];
		for(int i=0;i<m;i++){
			for(int j=0;j<m;j++){
				dt[i][j]=T[i][j];
			}
		}
		for(int k=0;k<m;k++){
			for(int i=0;i<m;i++){
				for(int j=0;j<m;j++){
					if(dt[i][j]>dt[i][k]+dt[k][j]){
						dt[i][j]=dt[i][k]+dt[k][j];
					}
				}
			}
		} 
		for(int i=0;i<m;i++){
			for(int j=0;j<m;j++){
				dc[i][j]=C[i][j];
			}
		}
		for(int k=0;k<m;k++){
			for(int i=0;i<m;i++){
				for(int j=0;j<m;j++){
					if(dc[i][j]>dc[i][k]+dc[k][j]){
						dc[i][j]=dc[i][k]+dc[k][j];
					}
				}
			}
		} 
		cin >> N;
		for(int I=0;I<N;I++){
			cin >> p >> q >> r;
			cout << (r?dt[p-1][q-1]:dc[p-1][q-1]) << endl;
		}
	}

	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;

bool open(int max[101],int name[101][101][2],int m,int basic,int r)
{
	int i;
	bool F5=false;
	for(i=1;i<=m;i++)
	{
		if(basic == i)
			continue;
		if(name[basic][i][r] != 0)
		{
			if(max[i] == -1)
			{
				max[i] = name[basic][i][r] + max[basic];
				if(F5 == false)
					F5 = true;
			}
			else if(max[i] > name[basic][i][r] + max[basic])
			{
				max[i] = name[basic][i][r] + max[basic];
				if(F5 == false)
					F5 = true;
			}
		}
	}
	return F5;
}

int main(void)
{
	while(1)
	{
		int n,m;
		int a,b,cost,time;
		int k;
		int p,q,r;
		int mintime;
		int mincost;
		int i,j,x,y;
		bool F5;

		int name[101][101][2] = {};//OÍ¿à
		int max[101]={};

		cin >> n >> m;

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

		for(i=0;i<n;i++)
		{
			cin >> a >> b >> cost >> time;
			name[a][b][0] = cost;
			name[b][a][0] = cost;
			name[a][b][1] = time;
			name[b][a][1] = time;
		}

		cin >> k;

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

			for(j=0;j<101;j++)
			{
				max[j] = -1;
			}

			max[p] = 0;

			while(F5 == true)
			{
				F5 = false;
				for(x=1;x<=n;x++)
				{
					if(open(max,name,m,x,r) == true)
					{
						if(F5 == false)
						{
							F5 = true;
						}
					}
				}
			}
			cout << max[q] << endl;
		}
	}
	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<map>
#define INF 10000000
using namespace std;
void cWarshall_Floyd();
void tWarshall_Floyd();
int glid_cost[101][101];
int glid_tim[101][101];
int n,m,a,b,tim,cost,qs,p,q,r;
void cWarshall_Floyd()
{
	int i,j,k;
	for(k=0;k<m;k++) {
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_cost[i][j]=min(glid_cost[i][j],glid_cost[i][k]+glid_cost[k][j]);
			}
		}
	}
}
void tWarshall_Floyd()
{
	int i,j,k;
	for(k=0;k<m;k++) {
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_tim[i][j]=min(glid_tim[i][j],glid_tim[i][k]+glid_tim[k][j]);
			}
		}
	}
}
int main(void)
{
	ios::sync_with_stdio(false);
	int i,j,k;
	while(1) {
		cin>>n>>m;
		if(n==0&&m==0) break;
		for(i=0;i<n;i++) {
			for(j=0;j<n;j++) {
				glid_cost[i][j]=INF;
				glid_tim[i][j]=INF;
			}
		}
		for(i=0;i<n;i++) {
			glid_cost[i][i]=0;
			glid_tim[i][j]=0;
		}
		for(i=0;i<n;i++) {
			cin>>a>>b>>cost>>tim;
			a--;b--;
			glid_cost[a][b]=cost;
			glid_cost[b][a]=cost;
			glid_tim[a][b]=tim;
			glid_tim[b][a]=tim;
		}
		cin>>qs;
		for(i=0;i<qs;i++) {
			cin>>p>>q>>r;
			if(r==0) {
				cWarshall_Floyd();
				cout<<glid_cost[p-1][q-1]<<endl;
			}
			else {
				tWarshall_Floyd();
				cout<<glid_tim[p-1][q-1]<<endl;
			}
		}
	}
	return 0;
}