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

#define INF 1000000;

struct line{
	int to,cost,time;
};

int n,m;
int s[100];
std::vector<std::vector<line> >sta(100);

int calc(int i,int j,int r){
	for(int k=0;k<sta[i].size();k++){
		if(r==0){
			if(sta[i][k].cost+s[i]<s[sta[i][k].to]){
				s[sta[i][k].to]=s[i]+sta[i][k].cost;
				calc(sta[i][k].to,k,r);
			}
		}else if(r==1){
			if(sta[i][k].time+s[i]<s[sta[i][k].to]){
				s[sta[i][k].to]=s[i]+sta[i][k].time;
				calc(sta[i][k].to,k,r);
			}
		}
	}
	return s[j];
}

int main(){
	while(std::cin>>n>>m){
		if(n==0&&m==0)break;
		for(int i=0;i<n;i++){
			int a,b,c,d;
			line e;
			std::cin>>a>>b>>c>>d;
			e.to=b,e.cost=c,e.time=d;
			sta[a].push_back(e);
			e.to=a;
			sta[b].push_back(e);
		}
		int k;
		std::cin>>k;
		for(int i=0;i<k;i++){
			for(int i=0;i<100;i++)s[i]=INF;
			int p,q,r;
			std::cin>>p>>q>>r;
			s[p]=0;
			std::cout<<calc(p,q,r)<<std::endl;
		}
	}
	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
#define M 2100000
using namespace std;	
int main(void)
{
	int i,j,n,k,m,a[1001],b[1001],cost[1001],time[1001],kk,pp,bre;
	int p,q,r;
	int kin[101][101],zi[101][101];
	int flg[10001],leng[10001],min;
	int kaku,skin,szi;
	
	while(1) {
		scanf("%d %d",&n,&m);
		if(n==0 && m==0) break;
		for(i=1;i<=n;i++) scanf("%d %d %d %d",&a[i],&b[i],&cost[i],&time[i]);
		/**/
		//??£??\????????????  ??????
		for(i=1;i<=m;i++) {
			for(j=1;j<=m;j++) {
				kin[i][j]=M;
			}
		}
		for(i=1;i<=m;i++) kin[i][i]=0;
		for(i=1;i<=n;i++)	kin[a[i]][b[i]]=cost[i];
		for(i=1;i<=n;i++)	kin[b[i]][a[i]]=cost[i];
		
		//??£??\???????????????
		for(i=1;i<=m;i++) {
			for(j=1;j<=m;j++) {
				zi[i][j]=M;
			}
		}
		for(i=1;i<=m;i++) zi[i][i]=0;
		for(i=1;i<=n;i++) zi[a[i]][b[i]]=time[i];
		for(i=1;i<=n;i++) zi[b[i]][a[i]]=time[i];
		/**/
		scanf("%d",&k);
		for(i=1;i<=k;i++) {
			scanf("%d %d ",&p,&q);
			scanf("%d",&r);
			for(j=1;j<=m;j++) {
				leng[j]=M;
				flg[j]=0;
			}
			pp=p;
			leng[pp]=0;
			if(r==0) {
				for(j=1;j<=m;j++) {
					min=M;
					for(kk=1;kk<=m;kk++) {
						if(flg[kk]==0 && leng[kk]<min) {
							kaku=kk;
							min=leng[kk];
						}
					}
					flg[kaku]=1;
					for(kk=1;kk<=m;kk++) {
						if((leng[kaku]+kin[kaku][kk])<leng[kk]) leng[kk]=leng[kaku]+kin[kaku][kk];
					}
				}
				printf("%d\n",leng[q]);
			}
			else {
				for(j=1;j<=m;j++) {
					min=M;
					for(kk=1;kk<=m;kk++) {
						if(flg[kk]==0 && leng[kk]<min) {
							kaku=kk;
							min=leng[kk];
						}
					}
					flg[kaku]=1;
					for(kk=1;kk<=m;kk++) {
						if((leng[kaku]+zi[kaku][kk])<leng[kk]) leng[kk]=leng[kaku]+zi[kaku][kk];
					}
				}
				printf("%d\n",leng[q]);
			}
		}
		/*
			//cost
		printf("??????\n");
		printf("      ");
		for(i=1;i<=m;i++) printf("%7d ",i);
		printf("\n");
		printf("\n");
		for(i=1;i<=m;i++) {
			printf("%7d  ",i);
			for(j=1;j<=m;j++) {
				printf("%7d ",kin[i][j]);
			}
			printf("\n");
		}
		printf("\n");
		printf("\n");
		//time
		printf("??????\n");
		printf("      ");
		for(i=1;i<=m;i++) printf("%7d ",i);
		printf("\n");
		printf("\n");
		for(i=1;i<=m;i++) {
			printf("%7d  ",i);
			for(j=1;j<=m;j++) {
				printf("%7d ",zi[i][j]);
			}
			printf("\n");
		}
		printf("\n");*/
	}
		return 0;
}

C++: #include <iostream>

#define N 101
#define INF 1e+9

using namespace std;
int main(void){
	int n,m;
	while(cin>>n>>m,n||m){
		int cost[N][N],times[N][N];
		for(int i=1;i<=m;++i)for(int j=1;j<=m;++j){cost[i][j]=times[i][j]=INF;}
		for(int i=0,a,b,c,t;i<n;++i){
			cin>>a>>b>>c>>t;
			cost[a][b]=cost[b][a]=c;
			times[a][b]=times[b][a]=t;
		}
		int k;cin>>k;
		for(int i=0,p,q,r;i<k;++i){
			cin>>p>>q>>r;
			if(r){//time
				int d[N];
				for(int j=1;j<=m;++j) d[j]=INF;
				d[p]=0;
				bool f=false;
				for(;;){
					for(int j=1;j<=m;++j){//from
						for(int k=1;k<=m;++k){//to
							if(d[j]!=INF && d[j] + times[j][k] < d[k]){
								f==true;
								d[k] = d[j] + times[j][k];
							}
						}
					}
					if(f==false) break;
					f=false;
				}
				cout<<d[q]<<endl;
			}else{//cost
				int d[N];
				for(int j=1;j<=m;++j) d[j]=INF;
				d[p]=0;
				bool f=false;
				for(;;){
					for(int j=1;j<=m;++j){//from
						for(int k=1;k<=m;++k){//to
							if(d[j]!=INF && d[j] + cost[j][k] < d[k]){
								f==true;
								d[k] = d[j] + cost[j][k];
							}
						}
					}
					if(f==false) break;
					f=false;
				}
				cout<<d[q]<<endl;
			}
		}
	}
	return 0;
}