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>
using namespace std;

const int MAX_N = 3000;
const int MAX_M = 100;
const int INF = 1000000;

int dist[MAX_M + 1][MAX_M + 1], cost[MAX_M + 1][MAX_M + 1];

void initialize(int m) {
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= m; j++) {
      dist[i][j] = dist[j][i] = (i == j)? 0:INF;
      cost[i][j] = cost[j][i] = (i == j)? 0:INF;
    }
  }
}

void minify(int m) {
  for (int k = 1; k <= m; k++) {
    for (int i = 1; i <= m; i++) {
      for (int j = 1; j <= m; j++) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
        cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
      }
    }
  }
}

int query(int p, int q, int r) {
  if (r == 0) {
    return cost[p][q];
  } else {
    return dist[p][q];
  }
}

int main() {
  int n, m;
  while(cin >> n >> m and (n != 0 or m != 0)) {
    int a, b, c, d;
    initialize(m);

    for (int i = 0; i < n; i++) {
      cin >> a >> b >> c >> d;
      cost[a][b] = cost[b][a] = c;
      dist[a][b] = dist[b][a] = d;
    }

    minify(m);

    int k, p, q, r;
    cin >> k;

    for (int i = 0; i < k; i++) {
      cin >> p >> q >> r;
      cout << query(p, q, r) << endl;
    }
  }
}

C++: #include<iostream>
#include<vector>
using namespace std;
class NextNodesData
{
public:	
	int nextNodesName;
	int nextNodesMany;
	int nextNodesTime;
};
class Nodes
{
public:
	vector<NextNodesData> nextNodes;
	int name;
	int minValue;
	bool fixed;
};

int main()
{
	int N, M;
	cin >> N >> M;
	vector<Nodes> nodesList;
	for(int i = 0; i < M; i++)
	{
		Nodes nodes;
		nodes.name = i+1;
		nodesList.push_back(nodes);
	}
	for(int j = 0; j < N; j++)
	{
		int Start;
		int End;
		int Many;
		int Time;
		cin >> Start >> End >> Many >> Time;

		NextNodesData nodes;
		nodes.nextNodesName = End;
		nodes.nextNodesMany = Many;
		nodes.nextNodesTime = Time;
		nodesList[Start - 1].nextNodes.push_back(nodes);

		NextNodesData rNodes;
		rNodes.nextNodesName = Start;
		rNodes.nextNodesMany = Many;
		rNodes.nextNodesTime = Time;
		nodesList[End - 1].nextNodes.push_back(nodes);
	}

	int Query;
	cin >> Query;

	for(int k = 0; k < Query; k++) 
	{
		
		 //???????????????
		for(int l = 0; l < nodesList.size(); l++)
		{
			nodesList[l].fixed = false;
		}
		int Start;
		int End;
		int mode;
		
		cin >> Start >> End;
		cin >> mode;

		if(Start == End)
		{
			cout << 0 << endl;
			continue;
		}

		nodesList[Start - 1].fixed = true;
		nodesList[Start - 1].minValue = 0;
		int nextFixedNodesName = Start;

		

		vector<Nodes> candidate;
		while(1)
		{
			//??????????¢????????????°??????????´????????????????????????¨???????????????????????????
			for(int m = 0; m < nodesList[nextFixedNodesName - 1].nextNodes.size(); m++)
			{
				Nodes obj;
				obj.name = nodesList[nextFixedNodesName - 1].nextNodes[m].nextNodesName;
				//??¢??????????????????????????????????????????????????????
				if(nodesList[obj.name - 1].fixed == true)
				{
					continue;
				}
				if(mode == 0)
				{
					obj.minValue = nodesList[nextFixedNodesName - 1].minValue + nodesList[nextFixedNodesName - 1].nextNodes[m].nextNodesMany;
				}
				else
				{
					obj.minValue = nodesList[nextFixedNodesName - 1].minValue + nodesList[nextFixedNodesName - 1].nextNodes[m].nextNodesTime;
				}
				//?¬???????????????????????????????????????????
				candidate.push_back(obj);				   
			}

			int minValue = 1000001;
			int minName  = -1;
			//?¬????????????????????£???????????°???????????????¢???
			for(int n = 0; n < candidate.size(); n++)
			{
				if(candidate.size() == 0)
				{
					cout << 0 << endl;
				}
				if(candidate[n].minValue < minValue)
				{
					minValue = candidate[n].minValue;
					minName = candidate[n].name;
				}  
			}
			if(minName == End)
			{
				cout << minValue << endl;
				break;
			}
			nodesList[minName - 1].minValue = minValue;
			nodesList[minName - 1].fixed = true;
			nextFixedNodesName = minName;

			
			for(auto itr = candidate.begin(); itr != candidate.end();)
			{
				if(nodesList[itr->name - 1].fixed == true)
				{
					itr = candidate.erase(itr);
				}
				else
				{
					itr++;
				}
			}
		}	
		

	} 

	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 k=0; k<m; k++){
      for(int i=0; i<m; i++){
        for(int j=0; j<m; j++){
          if(C[i][j]>C[i][k]+C[k][j]){
            C[i][j] = C[i][k]+C[k][j];
          }
        }
      }
    }

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

    int k;
    cin >> k;

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

    }

	}

	return 0;
}