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<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<queue>

using namespace std;

#define rep(i,n) for(int i=0;i<int(n);i++)
#define reps(i,n) for(int i=1;i<=int(n);i++)

class L{
	public:
	int a,c,t;
	L(int a,int c,int t):a(a),c(c),t(t){}
};

class S{
	public:
	int now;
	int p;
	S(int now,int p):now(now),p(p){}
	bool operator<(const S&a)const{
		return p>a.p;
	}
};

int main(){
	A:;
	
	int n,m;
	cin>>n>>m;
	
	if(n==0)return 0;
	
	vector<L> load[111];
	
	rep(i,n){
		int a,b,c,t;
		cin>>a>>b>>c>>t;
		
		load[a].push_back(L(b,c,t));
		load[b].push_back(L(a,c,t));
	}
	
	
	int k;
	cin>>k;
	
	rep(pp,k){
		int aa,bb,cc;
		cin>>aa>>bb>>cc;
		
		priority_queue<S> que;
		que.push(S(1,0));
		
		int visit[111]={0};
		while(1){
			if(que.empty())break;
			
			S u = que.top();
			que.pop();
			
			//printf("%d %d\n",u.now,u.p);
			
			if(u.now==m){
				printf("%d\n",u.p);
				break;
			}
			
			if(visit[u.now]==1)continue;
			visit[u.now]=1;
			
			rep(i,load[u.now].size()){
				
				L e = load[u.now][i];
				
				if(cc==0){
					que.push(S(e.a, u.p+e.c));
				}else{
					que.push(S(e.a, u.p+e.t));
				}
			}
		}
	}
	
	goto A;
}

C++: #include<cstdio>
#include<algorithm>

using namespace std;




int main()
{
	while(true)
	{
int timedate[2][105][105];
int n,m;
    memset(timedate,0,sizeof(timedate));
	scanf("%d%d",&n,&m);
	if(n==0&&m==0)break;
	int a, b, cost,time;
	for(int i=0;i<n;i++)
	{
		scanf("%d%d%d%d",&a,&b,&cost,&time);
		timedate[0][a][b]=cost;
		timedate[0][b][a]=cost;
		timedate[1][a][b]=time;
		timedate[1][b][a]=time;
	}
	int k;
	scanf("%d",&k);
	for(int i=0;i<k;i++)
	{
		int p,q,r;
		int date[105];
		int omin=1000000,jmin;
		fill(date,date+100,-1);
		scanf("%d%d%d",&p,&q,&r);
		date[p]=0;
		
			for(int u=1;u<100;u++)
			{
			omin=1000000;
			jmin=0;
		for(int j=1;j<100;j++)
		{
			if(date[j]!=-1)
			{
				for(int o=1;o<101;o++)
				{
					if(timedate[r][j][o]!=0&&o!=-1&&omin>date[j]+timedate[r][j][o]&&date[o]==-1)
					{
						omin=date[j]+timedate[r][j][o];
						jmin=o;
					}
				}
			}
		}
		date[jmin]=omin;
			}
		printf("%d\n",date[q]);
	}
	}
	return 0;
}

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

using namespace std;

int const Inf = 10000000;
int const N = 100;

typedef array<int, 2> line;

int main()
{
    int n, m;
    while( cin >> n >> m, n||m ) {
        line table[N][N] = {};

        for( int i=0; i<n; ++i ) {
            int a, b, cost, time;
            cin >> a >> b >> cost >> time;

            int const from = a-1, to = b-1;
            line const in = {{cost, time}};
            table[from][to] = in;
            table[to][from] = in;
        }

        int k;
        cin >> k;
        for( int i=0; i<k; ++i ) {
            int p, q, r;
            cin >> p >> q >> r;
            int const from = p-1, to = q-1;
            int d[N];
            fill( d, d+N, Inf );

            priority_queue<int> w;
            w.push( from );
            d[from] = 0;

            while( !w.empty() ) {
                int const cur = w.top();
                w.pop();

                for( int ii=0; ii<m; ++ii ) {
                    if ( table[cur][ii][0] == 0 )
                        continue;

                    if ( d[cur] + table[cur][ii][r] < d[ii] ) {
                        d[ii] = d[cur] + table[cur][ii][r];
                        w.push( ii );
                    }
                }
            }

            cout << d[to] << endl;
        }
    }
}

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

const int inf = 1e8;
int m,n;
//n経路の数（枝）　m駅の数（葉）
struct edge{
  int from,to,cost,time;
  edge(int from,int to,int cost,int time): from(from), to(to), cost(cost), time(time){}
};

vector<edge> es;
int shortest_path(int s,int e,int v){
  int d[m];
  for(int i = 0 ; i < n ; i ++)d[i] = inf;
  d[s] = 0 ;
  while(true){
    bool updata = false;
    for(int i = 0 ; i < n ; i ++){
      edge e = es[i];
      if(d[e.from] != inf && d[e.to]> d[e.from] + e.cost && v == 0){
	d[e.to] = d[e.from] + e.cost;
	updata = true;
      }

      if(d[e.from] != inf && d[e.to]> d[e.from] + e.time && v == 1){
	d[e.to] = d[e.from] + e.time;
	updata = true;
      }
    } 
    if(!updata) break;
  }
  return d[e];
}

int main(void){
  while(cin>>n>>m,m+n){
    for(int i = 0 ; i < n ; i ++){
      int s,t,c,ti;
      cin>>s>>t>>c>>ti;
      s--; t--;
      es.push_back(edge(s,t,c,ti));
    }
    int num;
    cin>>num;
    for(int i = 0 ; i < num ;  i++){
      int s,t,v;
      cin>>s>>t>>v;
      s--; t--;
      //cout<<s <<" " << t << " " << v<<" ";
      cout<<shortest_path(s,t,v)<<endl;
    }
  }
  
    
}

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


int main(){
	unsigned int c[110][110],t[110][110];	
	
	int n,v;
	
	int a,b;
	
	while(cin>>n>>v,n){
		for(int i=0;i<v+1;i++){
			for(int j=0;j<v+1;j++){
				int tmp;
				if(i==j){
					tmp=0;
				}else{
					tmp=2000000;
				}
				c[i][j]=tmp;
				t[i][j]=tmp;
			}
		}
		
		for(int i=0;i<n;i++){
			cin>>a>>b;
			cin>>c[a][b];
			c[b][a]=c[a][b];
			cin>>t[a][b];
			t[b][a]=t[a][b];
		}
		
		
		for(int k=1;k<v+1;k++){
			for(int i=1;i<v+1;i++){
				for(int j=1;j<v+1;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]);
				}
			}
		}
		
		
		cin>>n;
		bool r;
		for(int i=0;i<n;i++){
			cin>>a>>b;
			cin>>r;
			if(r){
				cout<<t[a][b]<<endl;
			}else{
				cout<<c[a][b]<<endl;
			}
		}
		
		
	}
}