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<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 99999
int dijkstra(int x,int y,int p);
int D[128][128][2];/*Adjacency matrix*/
int m;
int main(){
	while(1){
		int n;
		scanf("%d%d",&n,&m);
		if(n == 0 && m == 0)break;
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				if(i == j){
					D[i][j][0] = 0;
					D[i][j][1] = 0;
					continue;
				}
				D[i][j][0] = INF;
				D[i][j][1] = INF;
			}
		}
		
		for(int i = 0; i < n; i++){
			int from,to,cst,tm;
			scanf("%d%d%d%d",&from,&to,&cst,&tm);
			D[from][to][0] = cst;
			D[to][from][0] = cst;
			D[from][to][1] = tm;
			D[to][from][1] = tm;
		}
		int k;
		scanf("%d",&k);
		for(int i = 0; i < k; i++){
			int from,to,x;
			scanf("%d%d%d",&from,&to,&x);
			printf("%d\n",dijkstra(from,to,x));
		}
	}
	return 0;
}
int dijkstra(int x,int y,int p){
	int dist[128];
	bool done[128]={false};
	for(int i = 1; i <= m; i++){
		dist[i] = INF;
	}
	
	dist[x] = 0;
	int cost = 0;
	while(1){
		int e = -1;
		for(int i = 1; i <= m; i++){
			if(done[i] == false && (e == -1 || dist[i] < dist[e])){
				e = i;
			}
		}
		if(e == -1)break;
		done[e] = true;
		if(e == y){
			cost = dist[e];
			break;
		}
		
		for(int i = 1; i <= m; i++){
			if(p == 0)dist[i] = min(dist[i],dist[e]+D[e][i][0]);
			else dist[i] = min(dist[i],dist[e]+D[e][i][1]);
		}
		
	}
	return cost;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#define INF (1145141919)
using namespace std;

int n;

int from[3000];
int to[3000];
int cost[3000][2];

int d[100];
int r;
void Search(int s)
{
	for (int i = 0; i < 100; i++){
		d[i] = INF;
	}
	d[s] = 0;
	
	while (true){
		bool update = false;
		
		for (int i = 0; i < n * 2; i++){
			if (d[from[i]] != INF && d[to[i]] > d[from[i]] + cost[i][r]){
				d[to[i]] = d[from[i]] + cost[i][r];
				update = true;
			}
		}
		
		if (!update){
			break;
		}
	}
}
	

int main()
{	
	int m;
	while (scanf("%d %d", &n, &m), n + m){
		for (int i = 0; i < n; i++){
			int a, b, c, t;
			scanf("%d %d %d %d", &a, &b, &c, &t);
			a--;
			b--;
			
			
			from[i * 2] = a;
			to[i * 2] = b;
			cost[i * 2][0] = c;
			cost[i * 2][1] = t;
			
			from[i * 2 + 1] = b;
			to[i * 2 + 1] = a;
			cost[i * 2 + 1][0] = c;
			cost[i * 2 + 1][1] = t;
		}
		
		int k;
		scanf("%d", &k);
		
		for (int i = 0; i < k; i++){
			int p, q;
			scanf("%d %d %d", &p, &q, &r);
			p--;
			q--;
			
			Search(p);
			printf("%d\n", d[q]);
		}
	}
	
	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 k;
    int e[m][m];
    cin>>k;
    for(int i=0;i<m;i++){
      for(int j=0;j<m;j++){
        e[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(e[i][j]>e[i][k]+e[k][j]){
            e[i][j]=e[i][k]+e[k][j];
          }
        }
      }
    }
    for(int i=0;i<k;i++){
      int p, q, r;
      int a=0;
      cin>>p>>q>>r;
      int d[m][m];
      if(r==0){
        for(int i=0;i<m;i++){
          for(int j=0;j<m;j++){
            d[i][j]=C[i][j];
          }
        }
        a=d[p-1][q-1];
        cout<<a<<endl;
      }
      if(r==1){
        for(int i=0;i<m;i++){
          for(int j=0;j<m;j++){
            d[i][j]=T[i][j];
          }
        }
        a=d[p-1][q-1];
        cout<<a<<endl;
      }
    }
	}

	return 0;
}