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;
int main(void) {
    // Your code here!
    int INF = 10000000;
    
    while(true) {
        int n, m;
        cin >> n >> m;
        if(n == 0 && m == 0) break;
        
        int tableC[m][m];
        int tableT[m][m];
        
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < m; j++) {
                tableC[i][j] = INF;
                tableT[j][i] = INF;
            }
        }
        
        int a, b, c, t;
        for(int k = 0; k < n; k++) {
            cin >> a >> b >> c >> t;
            tableC[a-1][b-1] = c;           
            tableC[b-1][a-1] = c;            
            tableT[a-1][b-1] = t;            
            tableT[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(tableT[i][j] > tableT[i][k] + tableT[k][j]) {
                        tableT[i][j] = tableT[i][k] + tableT[k][j];
                    }
                    if(tableC[i][j] > tableC[i][k] + tableC[k][j]) {
                        tableC[i][j] = tableC[i][k] + tableC[k][j];
                    }
                }
            }
        }
        
        int l, p, q, r;
        cin >> l;
        for(int i = 0; i < l; i++) {
            cin >> p >> q >> r;
            if(r == 0) {
                cout << tableC[p-1][q-1] << endl;
            } else {
                cout << tableT[p-1][q-1] << 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 = -1;
			int minName  = -1;
			//?¬????????????????????£???????????°???????????????¢???
			for(int n = 0; n < candidate.size(); n++)
			{
				if(candidate[n].minValue < minValue || minValue == -1)
				{
					minValue = candidate[n].minValue;
					minName = candidate[n].name;
				}  
			}
			if(candidate.size() == 0)
			{
				cout << nodesList[End - 1].minValue << endl;
				break;
			}
			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>
const int MAX_E = 300, MAX_V = 100, INF = 1000000;
struct edge{int from, to, time, cost;};

edge es[MAX_E];
int d[MAX_V+1];
int n, m, k;

//0: time 1: cost
int minimum_value(int type, int start, int end){
	for(int i=0;i<=m;i++)d[i] = INF;
	d[start] = 0;

	int res = 0;
	while(true){
		bool update = false;
		for(int i=0;i<n;i++){
			edge e = es[i];
			int cost = type?e.cost:e.time;
			if(d[e.from] != INF && d[e.to] > d[e.from] + cost){
				d[e.to] = d[e.from] + cost;
				res = d[e.to];
				update = true;
			}		
		}
		if(!update)break;
	}

	return res;
}

int main(){
	while(std::cin >> n >> m, n){
		for(int i=0;i<n;i++){
			int from, to, time, cost;
			std::cin >> from >> to >> time >> cost;
			edge e;
			e.from = from, e.to = to, e.time = time, e.cost = cost;
			es[i] = e;
		}

		std::cin >> k;
		for(int j=0;j<k;j++){
			int start, end, type;
			std::cin >> start >> end >> type;
			std::cout << minimum_value(type, start, end) << std::endl;
		}
	}

	return 0;
}