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]
					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 <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

int main()
{
	int n, m;
	const int INF = 1 << 30;
	while (cin >> n >> m) {
		if (n == 0 && m == 0)
			break;

		vector<vector<int> > charge(m, vector<int>(m, INF));
		vector<vector<int> > time(m, vector<int>(m, INF));
		for (int i = 0; i < n; ++i) {
			int s, t, c, tm;
			cin >> s >> t >> c >> tm;
			--s;
			--t;
			charge[s][t] = charge[t][s] = c;
			time[s][t] = time[t][s] = tm;
		}

		vector<vector<pair<int, int> > > ans(m, vector<pair<int, int> >(m, pair<int, int>(INF, INF)));
		// dijkstra(charge)
		for (int i = 0; i < m; ++i) {
			ans[i][i].first = 0;
			priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > que;
			que.push(pair<int, int>(0, i));
			
			while (!que.empty()) {
				pair<int, int> q = que.top();
				que.pop();
				int v = q.second;
				if (ans[i][v].first < q.first)
					continue;
				for (unsigned int j = 0; j < charge[v].size(); ++j) {
					if (ans[i][j].first > ans[i][v].first + charge[v][j]) {
						ans[i][j].first = ans[i][v].first + charge[v][j];
						que.push(pair<int, int>(ans[i][j].first, j));
					}
				}
			}
		}

		// dijkstra(time)
		for (int i = 0; i < m; ++i) {
			ans[i][i].second = 0;
			priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > que;
			que.push(pair<int, int>(0, i));
			
			while (!que.empty()) {
				pair<int, int> q = que.top();
				que.pop();
				int v = q.second;
				if (ans[i][v].second < q.first)
					continue;
				for (unsigned int j = 0; j < time[v].size(); ++j) {
					if (ans[i][j].second > ans[i][v].second + time[v][j]) {
						ans[i][j].second = ans[i][v].second + time[v][j];
						que.push(pair<int, int>(ans[i][j].second, j));
					}
				}
			}
		}

		int k;
		cin >> k;
		for (int i = 0; i < k; ++i) {
			int p, q, r;
			cin >> p >> q >> r;
			--p;
			--q;
			if (r == 0)
				cout << ans[p][q].first << endl;
			else
				cout << ans[p][q].second << endl;
		}
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <stdlib.h>

using namespace std;

static const int TYPE_COST =0;
static const int TYPE_TIME =1;

class station{
public:
	int cost;
	bool visited;
	vector<int> edge_to;
	vector<int> edge_cost;
	vector<int> edge_time;
	
	 public:
		station() :  cost(-1), visited(false){}
		void add_to(int to, int cost, int time)
		{
			this->edge_to.push_back(to);
			this->edge_cost.push_back(cost);
			this->edge_time.push_back(time);
		}
};

int dijkstra(station* sta, int size, int from, int to, int type);
bool contain(vector<station> sta, station elem);
void reset(station* sta, int size);

int main(int argc, char** argv)
{
	while( 1 ){
		int n, m, from, to, cost, time, type;
		cin >> n;
		cin >> m;
		if(n==0 && m==0) break;
		
		station sta[m];
		for(int i=0; i<m; i++){
			sta[i] = station();
		}
		
		for(int i=0; i<n; i++){
			cin >> from;
			cin >> to;
			cin >> cost;
			cin >> time;
			sta[from-1].add_to(to-1, cost, time);
		}
		cin >> n;
		for(int i=0; i<n; i++){
			cin >> from;
			cin >> to;
			cin >> type;
			cout << dijkstra(sta, m, from-1, to-1, type) << endl;
			reset(sta, m);
		}
	}
	
	return 0;
}

int dijkstra(station* sta, int size, int start, int goal, int type)
{
	int to, cost;
	station done;
	vector<station> q;
	sta[start].cost = 0;
	q.push_back(sta[start]);
	
	while(!q.empty()){
		done = q[0];
		q.erase(q.begin());
		done.visited = true;
		
		for(int i=0; i<done.edge_to.size(); i++){
			to = done.edge_to[i];
			if(type==TYPE_COST) cost = done.cost + done.edge_cost[i];
			if(type==TYPE_TIME) cost = done.cost + done.edge_time[i];
			if(sta[to].cost < 0 || cost < sta[to].cost){
				sta[to].cost = cost;
				if(!contain(q, sta[to])){
					q.push_back(sta[to]);
				}
			}
		}	
	}
	
	return sta[goal].cost;
}

bool contain(vector<station> sta, station elem)
{
	int size = sta.size();
	bool is_match = false;
	for(int i=0; i<size; i++){
		if(memcmp(&sta[i], &elem, sizeof(station)) == 0){
			is_match = true;
			break;
		}
	}
	return is_match;
}

void reset(station* sta, int size)
{
	for(int i=0; i<size; i++){
		sta[i].visited = false;
		sta[i].cost = -1;
	}
}

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

#define rep(i,a) for(int i = 0 ; i < a ; i ++)
#define loop(i,a,b) for(int i = a ; i < b ; i ++)

int N,M;
int maze[110][110],tim[110][110];
int main(void){
	while(cin>>N>>M,N+M){
		rep(i,M+1)rep(j,M+1)maze[i][j] = (1<<28),tim[i][j] = (1<<28);
		while(N--){
			int a,b,c,t;
			cin>>a>>b>>c>>t;
			maze[--a][--b] = c;
			maze[b][a] = c;
			tim[a][b] = t;
			tim[b][a] = t;
		}
		rep(k,M+1){
			rep(i,M+1){
				rep(j,M+1){
					if(maze[i][j] > maze[i][k] + maze[k][j]){
						// update
						maze[i][j] = maze[i][k] + maze[k][j];
						tim[i][j] = min(tim[i][j],tim[i][k] + tim[k][j]);
					} 
				}
			}
		}
		//rep(i,M)rep(j,M)cout<<tim[i][j]<<(j==M-1?'\n':' ');
		cin>>N;
		while(N--){
			int a,b,t;
			cin>>a>>b>>t;
			--a;--b;
			cout<<(t?tim[a][b]:maze[a][b])<<endl;
		}
	}
}