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<stdio.h>
#include<string.h>
#define MAX 101
#define INT_MAX 1001
#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++: // A C / C++ program for Dijkstra's single source shortest path algorithm.
// The program is for adjacency matrix representation of the graph
  
#include <stdio.h>
#include <string.h>
#include <limits.h>
  
// Number of vertices in the graph
#define V 100
using namespace std;
int m,y;
  
// A utility function to find the vertex with minimum distance value, from
// the set of vertices not yet included in shortest path tree
int minDistance(int dist[], bool sptSet[])
{
   // Initialize min value
   int min = INT_MAX, min_index;
   int v;
  
   for (v = 0; v < m; v++)
     if (sptSet[v] == false && dist[v] <= min)
         min = dist[v], min_index = v;
  
   return min_index;
}
  
// A utility function to print the constructed distance array
void printSolution(int dist[], int n)
{
  printf("%d\n",dist[y-1]);
}
  
// Funtion that implements Dijkstra's single source shortest path algorithm
// for a graph represented using adjacency matrix representation
void dijkstra(int graph[V][V], int src)
{
      int i,u,v,count;
      int dist[V];     // The output array.  dist[i] will hold the shortest
                      // distance from src to i
  
      bool sptSet[V]; // sptSet[i] will true if vertex i is included in shortest
                     // path tree or shortest distance from src to i is finalized
  
     // Initialize all distances as INFINITE and stpSet[] as false
     for (i = 0; i < m; i++)
        dist[i] = INT_MAX, sptSet[i] = false;
  
     // Distance of source vertex from itself is always 0
     dist[src] = 0;
  
     // Find shortest path for all vertices
     for (count = 0; count < m-1; count++)
     {
       // Pick the minimum distance vertex from the set of vertices not
       // yet processed. u is always equal to src in first iteration.
       u = minDistance(dist, sptSet);
  
       // Mark the picked vertex as processed
       sptSet[u] = true;
  
       // Update dist value of the adjacent vertices of the picked vertex.
       for (v = 0; v < m; v++)
  
         // Update dist[v] only if is not in sptSet, there is an edge from 
         // u to v, and total weight of path from src to  v through u is 
         // smaller than current value of dist[v]
         if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX 
                                       && dist[u]+graph[u][v] < dist[v])
            dist[v] = dist[u] + graph[u][v];
     }
  
     // print the constructed distance array
     printSolution(dist, m);
}
  
// driver program to test above function
int main()
{
    int i,j,n,w,x,z;
    int graph[V][V],money[V][V];
    char str[200];

    while(1){ 
      fgets(str,sizeof(str),stdin);
      sscanf(str,"%d %d",&n,&m);
      if(n==0 && m==0) break;
      memset(graph, 0, sizeof(graph));
      memset(money, 0, sizeof(graph));
      for(i=0;i<n;i++){
        fgets(str,sizeof(str),stdin);
        sscanf(str,"%d %d %d %d",&w,&x,&y,&z);
        graph[w-1][x-1] = y;
        graph[x-1][w-1] = y;
        money[w-1][x-1] = z;
        money[x-1][w-1] = z;
      }
      fgets(str,sizeof(str),stdin);
      sscanf(str,"%d",&n);
      for(i=0;i<n;i++){
        fgets(str,sizeof(str),stdin);
        sscanf(str,"%d %d %d",&x,&y,&z);  
        (z==0 ? dijkstra(graph, x-1) : dijkstra(money, x-1));   
      }
    }
    /*for(i=0;i<m;i++){
      for(j=0;j<m;j++){
        printf("%d ",graph[i][j]);
      }
      printf("\n");
    }*/

    return 0;
}