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<stdio.h>
#include<string.h>
#define MAX 101
#define INT_MAX 100000000
#define min(a,b) (a>b?b:a)
int N;
int M[2][MAX][MAX];

void dijkstra( int s, int q,int flag){
    char visited[MAX]; // S É®·ém[hÍ true
	int d[MAX];
	int i;
    for (i = 1; i <= N; i++ ){
        d[i] = INT_MAX;
        visited[i] = 0;
    }
    
    d[s] = 0; // ÅÉ s ª u ÆµÄIÎêé
    
    while( 1 ){
        int u; // ÅKÈm[h u ðIÔ
        int mincost = INT_MAX;
        for ( i = 1; i <= N; i++ ){
            if ( !visited[i] && d[i] < mincost ){
                mincost = d[i]; u = i;
            }
        }
        
        // u ª¶ÝµÈ©Á½Æ«AÂÜè S ª±êÈã¦È¢Æ«AI¹
        if ( mincost == INT_MAX ) break;
        
        visited[u] = 1; // u ð S ÉÇÁ
        int v;
        for (  v = 1; v <= N; v++ ){
            // v ª S ÉÜÜêéê@Ü½Í@GbW(u, v)ªÈ¢êÍ@³
            if ( visited[v] || M[flag][u][v] == INT_MAX ) continue;
            d[v] = ( d[v]> d[u] + M[flag][u][v]?d[u]+M[flag][u][v]:d[v] );
        }
    }
	printf("%d\n",d[q]);
}

int main(){
	int m,i,j,a,b,c,t,k,p,q,r;
	
	while(~scanf("%d%d",&m,&N)){
		if(N==0 && m==0)break;
		
		for(i=1;i<=N;i++){
			for(j=1;j<=N;j++){
				M[0][i][j]=INT_MAX;
				M[1][i][j]=INT_MAX;
			}
		}
		
		for(i=0;i<m;i++){
			scanf("%d%d%d%d",&a,&b,&c,&t);
			M[0][a][b]=c;
			M[0][b][a]=c;
			M[1][a][b]=t;
			M[1][b][a]=t;
		}
		scanf("%d",&k);
		for(i=0;i<k;i++){
			scanf("%d%d%d",&p,&q,&r);
			dijkstra(p,q,r);
		}
	}
	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;
		}

		for (int i = 1; i < m; i++) {
			for (int j = 1; j < m; j++) {
				for (int k = 1; k < m; k++) {
					if (C[j][k] < C[j][i] + C[i][k]) {
						C[j][k] = C[j][i] + C[i][k];
					}
					if (T[j][k] < T[j][i] + T[i][k]) {
						T[j][k] = T[j][i] + T[i][k];
					}
				}
			}
		}

		int k = 0;
		cin >> k;
		for (int i = 0; i < k; i++) {
			int p, q, r;
			cin >> p >> q >> r;
			if (r == 0) {
				cout << C[p][q] << endl;
			}
			if (r == 1) {
				cout << T[p][q] << endl;
			}
		}
	











	}

	return 0;
}

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

typedef pair<int, int> P;
 
struct station
{
    station(int to, int cost, int time)
    {
        this->to = to;
        this->cost = cost;
        this->time = time;
    }

    int to;
    int cost;
    int time;
};

void dijkstra(int from, int mode);

vector<station> route[1000];
int mini[1000];
int n, m;

int main()
{
    while (scanf("%d %d", &n, &m) * n != 0){
        for (int i = 0; i < m; i++){
            route[i].clear();
        }
        for (int i = 0; i < n; i++){
            int a, b;
            int cost, time;
             
            scanf("%d %d %d %d", &a, &b, &cost, &time);
            a--, b--;
            route[a].push_back(station(b, cost, time));
            route[b].push_back(station(a, cost, time));
        }
        
        int k;
        scanf("%d", &k);
        while (k-- > 0){
            int p, q, r;
            scanf("%d %d %d", &p, &q, &r);
            p--, q--;
            mini[p] = 0;
            dijkstra(p, r);
            printf("%d\n", mini[q]);
        }
    }
    
    return 0;
}
 
void dijkstra(int from, int mode)
{
	priority_queue<P, vector<P>, greater<P> > que;
	
	fill(mini, mini + m, 1000000000);
	mini[from] = 0;
	que.push(P(0, from));
	
	while (!que.empty()){
		P p = que.top();
		que.pop();
		int v = p.second;
		
		if (mini[v] < p.first){
			continue;
		}
		for (int i = 0; i < route[v].size(); i++){
			station s = route[v][i];
			if (mode == 0 && mini[s.to] > mini[v] + s.cost){
				mini[s.to] = mini[v] + s.cost;
				que.push(P(mini[s.to], s.to));
			}
			else if (mode == 1 && mini[s.to] > mini[v] + s.time){
				mini[s.to] = mini[v] + s.time;
				que.push(P(mini[s.to], s.to));
			}
		}
	}
}