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>

int costs[100][100][2];

int main(){
 int n,m,a,b;
 scanf("%d%d",&n,&m);
 while(n--){
  scanf("%d%d",&a,&b);
  scanf("%d%d",&costs[a][b][0],&costs[a][b][1]);
  costs[b][a][0]=costs[a][b][0];
  costs[b][a][1]=costs[a][b][1];
 }
 for(int i=0;i<m;i++){
  for(int j=0;j<m;j++){
   for(int k=0;k<m;k++){
    costs[i][j][0]=costs[i][k][0]+costs[k][j][0];
    costs[j][i][0]=costs[i][j][0];
    costs[i][j][1]=costs[i][k][1]+costs[k][j][1];
    costs[j][i][1]=costs[i][j][1];
   }
  }
 }
 scanf("%d",&n);
 while(n--){
 scanf("%d&d&d",&a,&b,&m);
 printf("%d\n",costs[a][b][m]);
}
 return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <climits> 
#include <map>
using namespace std;

const int MAX_V = 1000; // ???????????°????????§???
const int INF = 1000000; // ???????????§?????????(int ???????????§???)
int v; // ????????°
int g[MAX_V][MAX_V]; // ??£??\??????
int g2[MAX_V][MAX_V];
int d[MAX_V]; // ??????s ????????????????????¢
bool used[MAX_V]; // ?????§??????????????¢????¢??????????????????¨???????????°

void dijkstra(int s)
{
  // ??????
  fill(d, d + v, INF);
  fill(used, used + v, false);

  

  d[s] = 0;
  // ??????s ????????????????????????????????¢????¨????
  for(;;){
    // ???????¢???????????????????????????????????????¢???????°???????????????¢???
    // ?????????????????¢???????????????????????¢????¢??????????
    int i = -1;
    for(int j = 0; j < v; ++j)
      if(!used[j] && (i == -1 || d[i] > d[j]))
	i = j;
    if(i == -1)break; // ??¨??????????????????????????¢????¢????????????´???
    // ?????????????????¢???????????????????????¢?¢????
    used[i] = true;
    // ???????????¢????¢?????????????????????£??\????????????????????±?????´??°
    for(int j = 0; j < v; ++j)
      d[j] = min(d[j], d[i] + g[i][j]);
  }
}

void dijkstra2(int s)
{
  // ??????
  fill(d, d + v, INF);
  fill(used, used + v, false);
  d[s] = 0;
  // ??????s ????????????????????????????????¢????¨????
  for(;;){
    // ???????¢???????????????????????????????????????¢???????°???????????????¢???
    // ?????????????????¢???????????????????????¢????¢??????????
    int i = -1;
    for(int j = 0; j < v; ++j)
      if(!used[j] && (i == -1 || d[i] > d[j]))
	i = j;
    if(i == -1)break; // ??¨??????????????????????????¢????¢????????????´???
    // ?????????????????¢???????????????????????¢?¢????
    used[i] = true;
    // ???????????¢????¢?????????????????????£??\????????????????????±?????´??°
    for(int j = 0; j < v; ++j)
      d[j] = min(d[j], d[i] + g2[i][j]);
  }
}


int main()
{
  for(;;){
    int gv, ge;
    cin >> ge >> gv;
    if(ge==0){return 0;}

    fill(&g[0][0], &g[MAX_V][0], 100000);
    fill(&g2[0][0], &g2[MAX_V][0], 100000);


    for(int i = 0; i < ge; ++i){
      int gs, gt, gd,gd2;
      cin >> gs >> gt >> gd >> gd2;
      g[gs-1][gt-1]=gd;
      g[gt-1][gs-1]=gd;
      g2[gs-1][gt-1]=gd2;
      g2[gs-1][gt-1]=gd2;
    }
    v = gv;

    //for(int i=0;i<v;i++){for(int j=0;j<v;j++){cout << g[i][j] << " ";}cout << endl;}
    
    int k;
    cin >> k;
    for(int i=0;i<k;i++){
      int p,q,r;
      cin >> p >> q >> r;
      if(r==0){
	dijkstra(p-1);
	//for(int j=1;j<=gv;j++)
	  cout << d[q-1] << endl;
      }else{
	dijkstra2(p-1);
	//for(int j=0;j<=gv;j++)
	  cout << d[q-1] << endl;
      }
    }
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;

const int INF=1e9;

//struct edge{int to,cost,time;};
struct edge{int cost,time;};

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

		//vector<edge> es[n];
		edge es[m][m];
		for(int i=0;i<m;i++){
			for(int j=0;j<m;j++) es[i][j] = (edge){INF,INF};
		}

		int a,b,cost,time;
		for(int i=0;i<n;i++){
			cin >> a >> b >> cost >> time;
		//	es[a].emplace_back((edge){b,cost,time});
			es[a-1][b-1] = (edge){cost,time};
			es[b-1][a-1] = es[a-1][b-1];
		}

		int d_cost[m][m];
		int d_time[m][m];
		for(int i=0;i<m;i++){
			for(int j=0;j<m;j++){
				d_cost[i][j] = es[i][j].cost;
				d_time[i][j] = es[i][j].time;
			}
		}

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

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

			if(r==0) cout << d_cost[p-1][q-1] << "\n";
			else	cout << d_time[p-1][q-1] << "\n";
		}
	}

	return 0;
}

C++: #include <iostream>
#include <cstring>

using namespace std;

const int INF=100000;
int cost[101][101];
int tim[101][101];

int main(void){
	int n,m,a,b,c;
	while(1){
		for(a=0;a<=100;a++){
			for(b=0;b<=100;b++){
				cost[a][b]=INF;
				tim[a][b]=INF;
				if(a==b)cost[a][b]=0,tim[a][b]=0;
			}
		}
		cin >> n >> m;
		if(n==0 && m==0)break;
		for(a=0;a<n;a++){
			int f,t,co,ti;
			scanf("%d%d%d%d",&f,&t,&co,&ti);
			if(cost[f][t]>co)cost[f][t]=co,cost[t][f]=co;
			if(tim[f][t]>ti)tim[f][t]=ti,tim[t][f]=ti;
		}
		for(a=1;a<=m;a++){
			for(b=1;b<=m;b++){
				for(c=1;c<=m;c++){
					cost[a][b]=min(cost[a][b],cost[a][c]+cost[c][b]);
					tim[a][b]=min(tim[a][b],tim[a][c]+tim[c][b]);
				}
			}
		}
		cin >> n;
		for(a=0;a<n;a++){
			int d,f,t;
			scanf("%d%d%d",&f,&t,&d);
			if(d==0)printf("%d\n",cost[f][t]);
			if(d==1)printf("%d\n",tim[f][t]);
		}
	}
    return 0;
}