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<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[201],q[201],r[201];
	int kin[101][101],zi[101][101];
	int flg[10001],leng[10001],min;
	int kaku,skin,szi;
	scanf("%d %d",&n,&m);
	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<=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];
	}
	/**/
	bre=0;
	scanf("%d",&k);
	while(1){
		for(i=1;i<=k;i++) {
			scanf("%d %d ",&p[i],&q[i]);
			if(p[i]==0 && q[i]==0) {
				break;
				bre=1;
			}
			scanf("%d",&r[i]);
		}
		if(bre==1) break;
		for(i=1;i<=k;i++) {
			for(j=1;j<=m;j++) {
				leng[j]=M;
				flg[j]=0;
			}
			pp=p[i];
			leng[pp]=0;
			
			if(r[i]==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[i]]);
			}
			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[i]]);
			}
		}

	/*	//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>
#include <algorithm>
using namespace std;

const int inf = 1 << 25;

int cost[100][100][2];
int d[100];
bool used[100];
int m;

int dijkstra(int s, int e, int r) {
  fill(d, d+m, inf);
  fill(used, used+m, false);
  d[s] = 0;

  while(true) {
    int v = -1;

    for(int u = 0; u < m; u++) {
      if(!used[u] && (v == -1 || d[u] < d[v])) v = u;
    }

    if(v == -1) break;

    used[v] = true;

    for(int u = 0; u < m; u++) {
      d[u] = min(d[u], d[v] + cost[v][u][r]);
    }
  }
  return d[e];
}

int main() {
  int n;
  while(cin >> n >> m, n+m) {
    for(int i = 0; i < 100; i++) {
      for(int j = 0; j < 100; j++) {
        cost[i][j][0] = cost[j][i][1] = inf;
      }
    }

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

    int k; cin >> k;
    while(k--) {
      int p, q, r; cin >> p >> q >> r;
      cout << dijkstra(p-1, q-1, r) << endl;
    }
  }
}

C++: #include<iostream>
using namespace std;
int c[110][110];
int t[110][110];
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		for(int j=1;j<=m;j++){
			c[i][j]=t[i][j]=10000000;
		}
	}
	for(int i=0;i<n;i++){
		int a,b,cost,time;
		cin>>a>>b>>cost>>time;
		c[a][b]=c[b][a]=cost;
		t[a][b]=t[b][a]=time;
	}
	for(int k=1;k<=m;k++){
		for(int i=1;i<=m;i++){
			for(int j=1;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;
		cout<<(r?t[p][q]:c[p][q])<<endl;
	}
	cin>>n>>m;
	return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
  int n,m,a,b,c,d,COST[101][101],TIME[101][101];
  while(1){
    for(int i=0;i<101;i++){
      for(int j=0;j<101;j++){
	COST[i][j] = TIME[i][j] = 1000000;
      }
    }

    cin >> n >> m;
    if(n==0&&m==0)break;
    for(int i=0;i<n;i++){
      cin >> a >> b >> c >> d;
      COST[a][b] = COST[b][a] = c;
      TIME[a][b] = TIME[b][a] = d;
    }
    for(int i=1;i<=m;i++){
      for(int j=1;j<=m;j++){
	for(int k=1;k<=m;k++){
	  if(COST[j][k]>COST[j][i]+COST[i][k]){
	    COST[j][k]=COST[j][i]+COST[i][k];
	  }
	  if(TIME[j][k]>TIME[j][i]+TIME[i][k]){
	    TIME[j][k]=TIME[j][i]+TIME[i][k];
	  }
	}
      }
    }
    cin >> m;
    for(int i=0;i<m;i++){
      cin >> a >> b >> c;
      cout << (c==0?COST[a][b]:TIME[a][b]) << endl;
    }
  }
}