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]
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[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>
using namespace std;
class NextNodesData
{
public:	
	NextNodesData()
	{

	}
	int nextNodesName;
	int nextNodesMany;
	int nextNodesTime;
};
class Nodes
{
public:
	Nodes()
	{
	}
	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 i = 0; i < N; i++)
	{
		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);
	}

	int Query;
	cin >> Query;

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

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

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

			int minValue = 1001;
			int minName  = -1;
			for(int j = 0; j < candidate.size(); j++)
			{
				
				if(candidate[j].minValue < minValue)
				{
					minValue = candidate[j].minValue;
					minName = candidate[j].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++;
				}
			}
		}
		

	} 

	int a, b;
	cin >> a;
	cin >> b;
	return 0;

}

C++: #include<iostream>
using namespace std;
int c[110][110];
int t[110][110];
int main(){
	int n,m;
	for(;cin>>n>>m,n+m;){
	for(int i=1;i<=m;i++){
		for(int j=1;j<=m;j++){
			c[i][j]=t[i][j]=10000000;
		}
	}
	for(int i=1;i<=m;i++)c[i][i]=t[i][i]=0;
	for(int i=0;i<n;i++){
		int a,b,cost,time;
		cin>>a>>b>>cost>>time;
		c[a][b]=c[b][a]=min(cost,c[a][b]);
		t[a][b]=t[b][a]=min(time,t[a][b]);
	}
	for(int k=1;k<=m;k++){
		for(int i=1;i<=m;i++){
			for(int j=1;j<=m;j++){
				c[i][j]=min(c[i][j],c[i][k]+c[k][j]);
				t[i][j]=min(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;
		cout<<(r?t[p][q]:c[p][q])<<endl;
	}
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
const double inf=1e8;
using namespace std;
int main(){
  int a,b;
  while(cin>>a>>b,a||b){
    int d1[101][101];
    int d2[101][101];
    rep(i,101)rep(j,101){
      d1[i][j]=inf;
      d2[i][j]=inf;
    }
    rep(i,a){
      int c,d,e,f;
      cin>>c>>d>>e>>f;
      c--;d--;
      d1[c][d]=e;d1[d][c]=e;
      d2[c][d]=f;d2[d][c]=f;
    }
    rep(i,b)rep(j,b)rep(k,b){
      d1[i][j]=min(d1[i][j],d1[i][k]+d1[k][j]);
      d2[i][j]=min(d2[i][j],d2[i][k]+d2[k][j]);
    }
    int n;cin>>n;
    rep(i,n){
      int g,h,l;cin>>g>>h>>l;
      g--;h--;
      if(l)cout<<d2[g][h]<<endl;
      else cout<<d1[g][h]<<endl;
    }
  }
}

C++: #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#define INF 1000000
void cWarshall_Floyd();
void tWarshall_Floyd();
int glid_cost[100][100];
int glid_tim[100][100];
int n,m,a,b,tim,cost,qs,p,q,r;
using namespace std;
void cWarshall_Floyd()
{
	int i,j,k;
	for(k=0;k<m;k++) {
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_cost[i][j]=min(glid_cost[i][j],glid_cost[i][k]+glid_cost[k][j]);
			}
		}
	}
}
void tWarshall_Floyd()
{
	int i,j,k;
	for(k=0;k<m;k++) {
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_tim[i][j]=min(glid_tim[i][j],glid_tim[i][k]+glid_tim[k][j]);
			}
		}
	}
}
int main(void)
{
	ios::sync_with_stdio(false);
	int i,j,k;
	while(1) {
		cin>>n>>m;
		if(n==0&&m==0) break;
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_cost[i][j]=INF;
				glid_tim[i][j]=INF;
			}
		}
		for(i=0;i<m;i++) {
			glid_cost[i][i]=0;
			glid_tim[i][j]=0;
		}
		for(i=0;i<n;i++) {
			cin>>a>>b>>cost>>tim;
			a--;b--;
			glid_cost[a][b]=cost;
			glid_cost[b][a]=cost;
			glid_tim[a][b]=tim;
			glid_tim[b][a]=tim;
		}
		cWarshall_Floyd();tWarshall_Floyd();
		cin>>qs;
		for(i=0;i<qs;i++) {
			cin>>p>>q>>r;
			if(r==0) cout<<glid_cost[p-1][q-1]<<endl;
			else cout<<glid_tim[p-1][q-1]<<endl;
		}
	}
	return 0;
}