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 <iostream>
#include <vector>
using namespace std;

struct Node{
    vector<int> to;
    vector<int> cost;
    vector<int> time;

    bool done;
    int minCost;
    int from;
};

void addEdge(int v, int u, int c, int t, struct Node *node){
    node[u].to.push_back(v);
    node[u].cost.push_back(c);
    node[u].time.push_back(t);
    node[v].to.push_back(u);
    node[v].cost.push_back(c);
    node[v].time.push_back(t);
}


void dijkstra(int n, int start, int end, int k, struct Node *node){
    for(int i=0; i<n; ++i){
        node[i].done = false;
        node[i].minCost = -1;
    }
    node[start].minCost = 0;
    while(1){
        int doneNode = -1;
        for(int i=0; i<n; ++i){
            if(node[i].done == true) continue;
            if(node[i].minCost < 0) continue;
            if(doneNode < 0 || node[i].minCost < node[doneNode].minCost) doneNode = i;
        }
        if(doneNode == -1) break;
        node[doneNode].done = true;
        for(int i=0; i<node[doneNode].to.size(); ++i){
            int to = node[doneNode].to[i];
            int cost = node[doneNode].minCost + (k==0?node[doneNode].cost[i]:node[doneNode].time[i]);
            if(node[to].minCost < 0 || cost < node[to].minCost){
                node[to].minCost = cost;
                node[to].from = doneNode;
            }
        }
    }
}

int main(){
    int n, m;
    while(cin >> n >> m, n != 0 && m != 0){
        struct Node node[m];
        for(int i=0; i<n; ++i){
            int a, b, cost, time;
            cin >> a >> b >> cost >> time;
            addEdge(a-1, b-1, cost, time, node);
        }
        int k;
        cin >> k;
        for(int i=0; i<k; ++i){
            int p, q, r;
            cin >> p >> q >> r;
            dijkstra(n, p-1, q-1, r, node);
            cout << node[q-1].minCost << endl;
        }
    }
    return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <functional>
#include <time.h>
using namespace std;
clock_t fi, endtime;

const int INF = INT16_MAX;
const int r_c = 0;
const int r_t = 1;
const int MAX_V = 100;
const int MAX_E = 6000;

int n, m, a, b, c, t;
int k, p, q, r;

int wft[MAX_V][MAX_V] = { 0 };
int wfc[MAX_V][MAX_V] = { 0 };

int main()
{
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; ++i) {
		for (int j = 0; j < m; ++j) {
			wfc[i][j] = INF; wft[i][j] = INF;
		}
	}

	for (int i = 0; i < n; ++i) {
		scanf("%d %d %d %d", &a, &b, &c, &t);
		wft[a - 1][b - 1] = t;  wft[b - 1][a - 1] = t;
		wfc[a - 1][b - 1] = c;  wfc[b - 1][a - 1] = c;
	}
	for (int k = 0; k < m; ++k) {
		for (int i = 0; i < m; ++i) {
			for (int j = 0; j < m; ++j) {
				if (wft[i][j] > wft[i][k] + wft[k][j]) { wft[i][j] = wft[i][k] + wft[k][j]; }
				if (wfc[i][j] > wfc[i][k] + wfc[k][j]) { wfc[i][j] = wfc[i][k] + wfc[k][j]; }
			}
		}
	}
	scanf("%d", &k);
	int ans = 0;
	for (int i = 0; i < k; ++i){
		scanf("%d %d %d", &p, &q, &r);
		if (p == 0 && q == 0) break;
		if (r == 0) { ans = wfc[p - 1][q - 1]; }
		else { ans = wft[p - 1][q - 1]; }
		printf("%d\n", ans);
	}

}

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

}