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<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){
	std::vector<int>a;
	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;
				a.push_back(sta[i][k].to);
			}
		}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;
				a.push_back(sta[i][k].to);
			}
		}
	}
	for(int k=0;k<a.size();k++)calc(a[k],j,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 <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int MAX_INT = 10000;
int n, m;
int p, q, r;

int costMap[101][101];
int timeMap[101][101];
int visited[101];

class Node {
public:
	int cost, pos;
	Node(int p) {
		cost = 0;
		pos = p;
	}
	Node(int p, int c, const Node& pre) {
		cost = c + pre.cost;
		pos = p;
	}
	bool operator< (const Node& o) const {
		return cost > o.cost;
	}
};

int main () {
	while (cin >> n >> m, n || m) {
		for (int i = 0; i < m; i++) {
			fill(costMap[i], costMap[i] + m + 1, MAX_INT);
			fill(timeMap[i], timeMap[i] + m + 1, MAX_INT);
		}
		for (int i = 0; i < n; i++) {
			int a, b, cost, time;
			cin >> a >> b >> cost >> time;
			costMap[a][b] = costMap[b][a] = cost;
			timeMap[a][b] = timeMap[b][a] = time;
		}
		int k;
		for (cin >> k; k; k--) {
			cin >> p >> q >> r;
			fill(visited, visited + m + 1, MAX_INT);
			priority_queue<Node> que;
			que.push(Node(p));
			visited[p] = 0;
			while (!que.empty()) {
				Node current = que.top();
				que.pop();
				if (current.pos == q) {
					cout << current.cost << endl;
					break;
				}
				for (int i = 1; i <= m; i++) {
					if (r) {
						if (timeMap[current.pos][i] != MAX_INT && timeMap[current.pos][i] + current.cost < visited[i]) {
							visited[i] = timeMap[current.pos][i] + current.cost;
							que.push(Node(i, timeMap[current.pos][i], current));
						}
					}
					else {
						if (costMap[current.pos][i] != MAX_INT && costMap[current.pos][i] + current.cost < visited[i]) {
							visited[i] = costMap[current.pos][i] + current.cost;
							que.push(Node(i, costMap[current.pos][i], current));
						}
					}
				}
			}
		}
	}
	return 0;
}

C++: #include<cstdio>
#include<queue>
#include <algorithm>
using namespace std;



int d[100];
bool used[100];

int n,m,k;
int INF=200000000;



int main(){

	int i,j;
	int a,b,c,e;

	int cost[100][100];
	int time[100][100];


	scanf("%d %d",&n,&m);

	fill((int*)cost,(int*)(cost+m),INF);
	fill((int*)time,(int*)(time+m),INF);

	/*
	fill(d,d+m,INF);
	memset(used,0,sizeof(used));
	*/

	for(i=0;i<n;i++){
		scanf("%d %d %d %d",&a,&b,&c,&e);
		a--;
		b--;
		cost[a][b]=cost[b][a]=c;
		time[a][b]=time[b][a]=e;
	}

	scanf("%d",&k);

	for(i=0;i<k;i++){
		scanf("%d %d %d",&a,&b,&c);
		a--;
		b--;
		
		fill(d,d+m,INF);
		fill(used,used+m,false);

		d[a]=0;
		
		
		while(true){
			int v=-1;
			
			//printf("-\n");

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

			if(c) for(j=0;j<m;j++) d[j]=min(d[j],d[v]+time[v][j]);
			else  for(j=0;j<m;j++) d[j]=min(d[j],d[v]+cost[v][j]);
		}
		printf("%d\n",d[b]);
		
		

	}
	scanf("%d %d",&a,&b);


	return 0;
}



	//scanf("%s",&i);

C++: #include<iostream>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define INF 300000

struct E
{
    int a,b,c,t;
    E(){};
    E(int a,int b,int c,int t):a(a),b(b),c(c),t(t){};
};
E cs[700];
unsigned int d[150];

int main()
{
    int n,m,k,p,q,r;
    while(cin >> n >> m)
    {
        if(n==0 && m==0)break;
        
        int ta,tb,tc,tt;
        rep(i,n)
        {
            cin >> ta>>tb>>tc >>tt;
            cs[2*i] = E(ta,tb,tc,tt);
            cs[2*i+1] = E(tb,ta,tc,tt);
        }

        cin >> k;
        rep(i,k)
        {
            memset(d,INF,150*sizeof(int));
            cin >> p >> q >>r;
            d[p] = 0;

            bool update = false;
            if(r==0)while(true)
            {
                update = false;
                rep(j,n*2)
                {
                   if(d[cs[j].a] != INF && d[cs[j].b] > d[cs[j].a] + cs[j].c)
                   {
                       update = true;
                       d[cs[j].b] =  d[cs[j].a] + cs[j].c;
                   }
                }
                if(!update) break;
            }
            if(r==1)while(true)
            {
                update = false;
                rep(j,n*2)
                {
                   if(d[cs[j].a] != INF && d[cs[j].b] > d[cs[j].a] + cs[j].t)
                   {
                       update = true;
                       d[cs[j].b] =  d[cs[j].a] + cs[j].t;
                   }
                }
                if(!update) break;
            }
            cout << d[q] << endl;
        }
        
    }

    return 0;
}