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:	
	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 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;

		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 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(nodesList[candidate[j].name - 1].fixed == true)
				{
					continue;
				}

				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++;
				}
			}*/
		}	
		

	} 

	return 0;

}

C++: #include <vector>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <list>
using namespace std;

#define INF 99999999

int gcd(int x, int y) {
	if (x % y == 0)return y;
	else return gcd(y, x%y);
}

int lcm(int x, int y) {
	return x*y / gcd(x, y);
}

int c[1001][1001];
int t[1001][1001];
int main() {
	while (1) {
		int n, m;
		cin >> n >> m;
		if (n == 0)break;
		for (int i = 0; i < m + 1; i++)for (int j = 0; j < m + 1; j++) {
			c[i][j] = t[i][j] = INF;
			if (i == j)c[i][j] = t[i][j] = 0;
		}
		for (int i = 0; i < n; i++) {
			int a, b, c_, t_;
			cin >> a >> b >> c_ >> t_;
			c[a][b] = c[b][a] = c_;
			t[a][b] = t[b][a] = t_;
		}
		for (int k = 1; k < m + 1; k++)for (int i = 1; i < m + 1; i++)for (int j = 1; j < m + 1; 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;
			if (r)cout << t[p][q] << endl;
			else cout << c[p][q] << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<s;i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
using namespace std;
typedef pair<int,int> pii;
#define MAX 99999999
signed main(){
while(1){
	int n,m;
	cin>>n>>m;
    if(!(n+m))break;
	vector<vector<pii>>v(n+1,vector<pii>(n+1,pii(INF,INF)));
	rep(i,n+1)v[i][i]=pii(0,0);
	rep(i,n){
		pii temp;
		int s,g;
		cin>>s>>g>>temp.first>>temp.second;
        v[--s][--g]=temp;
	}
    rep(k,n){
        rep(i,n){
            rep(j,n){
                v[i][j].first=min(v[i][k].first+v[k][j].first,v[i][j].first);
                v[i][j].second=min(v[i][k].second+v[k][j].second,v[i][j].second);

            }
        }
    }
    int k; cin>>k;
    rep(i,k){
        int s,g,r; cin>>s>>g>>r;
        if(!r)cout<<v[--s][--g].first<<endl;
        else cout<<v[--s][--g].second<<endl;
    }
    
    }
}