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;
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.size() == 0)
				{
					cout << 0 << endl;
				}
				if(candidate[j].minValue < minValue)
				{
					minValue = candidate[j].minValue;
					minName = candidate[j].name;
				}  
			}
			if(minName == -1)
			{
				cout << 0 << 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<cstdio>
#include<iostream>
#include<queue>

#define NMAX 3000
#define MMAX 100
#define INF (1000*MMAX+100)*100
using namespace std;

int main(void){

	int n,m;
	int a[NMAX*2],b[NMAX*2],cost[2*2][NMAX*2];
	int k;
	int p,q,r,flag;
	int node[MMAX*2];

	while(1){
		cin>>n>>m;
		if(n==0||m==0) break;
		for(int i=0;i<n;i++){
			cin>>a[i]>>b[i]>>cost[0][i]>>cost[1][i];
		}
		cin>>k;
		for(int i=0;i<k;i++){
			cin>>p>>q>>r;

			for(int j=0;j<n;j++) node[j]=INF;
			node[p]=0;
			flag=1;
			while(flag){
				flag=0;
				for(int j=0;j<n;j++){
					if(node[a[j]]!=INF){
						if(node[b[j]]>node[a[j]]+cost[r][j]){
							node[b[j]]=node[a[j]]+cost[r][j];
							flag=1;
						}
					}
					if(node[b[j]]!=INF){
						if(node[a[j]]>node[b[j]]+cost[r][j]){
							node[a[j]]=node[b[j]]+cost[r][j];
							flag=1;
						}
					}
				}
			}
			
			cout<<node[q]<<endl;
		}
	}

	return 0;
}

C++: #include<iostream>

#define INF 1000000
using namespace std;

int main(){
	int data[2][110][110];
	
	int n,m;
	while(cin>>n>>m && n|m){
		for(int i=0;i<110;i++){
		for(int j=0;j<110;j++){
				data[1][i][j]=INF;
				data[0][i][j]=INF;
			
		}
	}
	int a,b,cost,time;
	for(int i=0;i<n;i++){
		cin>>a>>b>>cost>>time;
		data[0][a][b]=cost;
		data[0][b][a]=cost;
		data[1][a][b]=time;
		data[1][b][a]=time;
	}

	for(int count=0;count<2;count++){
		for(int k=1;k<=m;k++){
			for(int i=1;i<=m;i++){
				for(int j=1;j<=m;j++)data[count][i][j]=min(data[count][i][j],data[count][i][k]+data[count][k][j]);
			}
		}
	}			

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

C++: #include<stdio.h>

int d[100][100];
int s[100][100];
int dd[100][100];
int ss[100][100];
int main(){
	while(1){
	int a,b;
	scanf("%d%d",&a,&b);
	if(b==0)return 0;
	for(int i=0;i<b;i++)
		for(int j=0;j<b;j++){
			d[i][j]=99999999;
			dd[i][j]=99999999;
		}
	
	for(int i=0;i<a;i++){
		int m,n,o,p;
		scanf("%d%d%d%d",&m,&n,&o,&p);
		d[m-1][n-1]=o;
		d[n-1][m-1]=o;
		dd[m-1][n-1]=p;
		dd[n-1][m-1]=p;
	}
	int h=0;
	for(int i=0;i<b;i++){
		for(int j=0;j<b;j++){
			s[i][j]=j;
		}
	}
	while(1<<h<b-1){
		for(int i=0;i<b;i++){
			for(int j=0;j<b;j++){
				for(int k=0;k<b;k++){
					if(d[i][j]>d[k][j]+d[i][k]){
						d[i][j]=d[i][k]+d[k][j];
						s[i][j]=s[i][k];
					}
				}
			}
		}
		h++;
	}
	h=0;
	for(int i=0;i<b;i++){
		for(int j=0;j<b;j++){
			ss[i][j]=j;
		}
	}
	while(1<<h<b-1){
		for(int i=0;i<b;i++){
			for(int j=0;j<b;j++){
				for(int k=0;k<b;k++){
					if(dd[i][j]>dd[k][j]+dd[i][k]){
						dd[i][j]=dd[i][k]+dd[k][j];
						ss[i][j]=ss[i][k];
					}
				}
			}
		}
		h++;
	}
	
	int x;
	scanf("%d",&x);
	for(int i=0;i<x;i++){
		int m,n,o;
		scanf("%d%d%d",&m,&n,&o);
		if(o)printf("%d\n",dd[m-1][n-1]);
		else printf("%d\n",d[m-1][n-1]);
	}
	}
}