Go: // Warshall–Floyd Algorithm

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

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
					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 <bits/stdc++.h>
using namespace std;
typedef pair<int,int > P;
const int INF = 1 << 30;
int Dijkstra(int s,int g,int r);

int m,n;

int min_cost[2][111];

typedef struct{
  vector<int>edge_to;
  vector<int>edge_cost[2];
}Node_data;

Node_data Graph[111];

priority_queue<P ,vector< P >, greater< P > >que;

int main(){
  int a,b,c,d,k;
  int s,g,r;
  while(1){
    for(int i = 0;i < 111;i++){
      Graph[i].edge_to.clear();
      Graph[i].edge_cost[0].clear();
      Graph[i].edge_cost[1].clear();
    }
    cin >> m >> n;
    if(m == 0 && n == 0)break;
    for(int i = 0;i < m;i++){
      scanf("%d %d %d %d",&a,&b,&c,&d);
      Graph[a - 1].edge_to.push_back(b - 1);
      Graph[a - 1].edge_cost[0].push_back(c);
      Graph[a - 1].edge_cost[1].push_back(d);
      Graph[b - 1].edge_to.push_back(a - 1);
      Graph[b - 1].edge_cost[0].push_back(c);
      Graph[b - 1].edge_cost[1].push_back(d);
    }
    cin >> k;
    for(int i = 0;i < k;i++){

      cin >> s >> g >> r;
      
      for(int j = 0;j < n;j++){
	min_cost[r][j] = INF;
      }
      cout << Dijkstra(s - 1,g - 1,r) << endl;
    }
  }
  return(0);
}

int Dijkstra(int s,int g,int r){
  int node,cost;
  int newnode,newcost;
  min_cost[r][s] = 0;
  P a;
  a.first = 0;
  a.second = s;
  que.push(a);
  while(!que.empty()){
    node = que.top().second;
    cost = que.top().first;
    que.pop();
    // if(node == g)return cost;
    if(cost > min_cost[r][node])continue;
    for(int i = 0;i < Graph[node].edge_to.size();i++){
      newnode = Graph[node].edge_to[i];
      newcost = cost + Graph[node].edge_cost[r][i];
      if(min_cost[r][newnode] > newcost){
	min_cost[r][newnode] = newcost;
	a.first = newcost;
	a.second = newnode;
	que.push(a);
      }
    }
  }
  return min_cost[r][g];
}

C++: #include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<functional>
#define pb push_back
#define MAX_V 2000//場合によって変更
#define INF 1000000000
using namespace std;
typedef pair<int,int> P;//firstは最短距離,secondは頂点番号
struct edge{
	int to,cost;
};
int V;//頂点の数
vector<vector<edge> > G;
//-----------
vector<vector<edge> > G2;
//-----------
int dijkstra(int s,int g){
	priority_queue<P,vector<P> , greater<P> > que;
	vector<int> d(V,INF);
	d[s]=0;
	que.push(P(0,s));
	while(!que.empty()){
		P p=que.top();
		que.pop();
		int v=p.second;
		if(d[v]<p.first)
			continue;
		for(int i=0;i<G[v].size();i++){
			edge e=G[v][i];
			if(d[e.to]>d[v]+e.cost){
				d[e.to]=d[v]+e.cost;
				que.push(P(d[e.to],e.to));
			}
		}
	}
	
	return d[g];
}
//-----------
int dijkstra2(int s,int g){
	priority_queue<P,vector<P> , greater<P> > que;
	vector<int> d(V,INF);
	d[s]=0;
	que.push(P(0,s));
	while(!que.empty()){
		P p=que.top();
		que.pop();
		int v=p.second;
		if(d[v]<p.first)
			continue;
		for(int i=0;i<G2[v].size();i++){
			edge e=G2[v][i];
			if(d[e.to]>d[v]+e.cost){
				d[e.to]=d[v]+e.cost;
				que.push(P(d[e.to],e.to));
			}
		}
	}
	
	return d[g];
}
//--------------
int main(){
	int E;
	while(cin>>E>>V,E){
		G.clear();
		G.resize(V);
		//------------
		G2.clear();
		G2.resize(V);
		//---------------
		for(int i=0;i<E;i++){
			int x,y,c,t;
			cin>>x>>y>>c>>t;x--;y--;
			edge e;
			e.cost=c;
			e.to=y;
			G[x].pb(e);
			e.to=x;
			G[y].pb(e);
			//--------------
			e.cost=t;
			e.to=y;
			G2[x].pb(e);
			e.to=x;
			G2[y].pb(e);
			//---------------
		}
		int n;
		cin>>n;
		for(int i=0;i<n;i++){
			int s,t,q;
			cin>>s>>t>>q;
			if(q==0)
			cout<<dijkstra(s-1,t-1)<<endl;
			else
			cout<<dijkstra2(s-1,t-1)<<endl;
		}
	}
	
	return 0;
}

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

const int INF = 10000000;

using Mat = std::vector< std::vector<int> >;

void wf(Mat& adj_mat) {
  int n = adj_mat.size();

  for(int i = 0; i < n; ++i) {     // via node
    for(int j = 0; j < n; ++j) {   // start
      for(int k = 0; k < n; ++k) { // terminal
        adj_mat[j][k] = std::min(adj_mat[j][k], adj_mat[j][i] + adj_mat[i][k]);
      }
    }
  }
}

int main() {
  int n, m;
  int a, b, cost, time;

  std::cin >> n >> m;
  Mat cost_table, time_table;
  cost_table.resize(m);
  time_table.resize(m);
  for(int i = 0; i < m; ++i) {
    cost_table.at(i).resize(m);
    time_table.at(i).resize(m);
    for(int j = 0; j < m; ++j){
      cost_table[i][j] = INF;
      time_table[i][j] = INF;
    }
  }

  for(int i = 0; i < n; ++i){
    std::cin >> a >> b >> cost >> time;
    --a, --b;
    cost_table[a][b] = cost_table[b][a] = cost;
    time_table[a][b] = time_table[b][a] = time;
  }

  wf(cost_table);
  wf(time_table);

  // Query
  int k;
  int p, q, r;
  std::cin >> k;
  for(int i = 0; i < k; ++i){
    std::cin >> p >> q >> r;
    --p, --q;
    if (r == 0)
      std::cout << cost_table[p][q] << std::endl;
    else
      std::cout << time_table[p][q] << std::endl;

  }
  int zero;
  std::cin >> zero >> zero;
}