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++: //AOJ 0200
//菴ソ縺?婿繧ゅｏ縺九ｉ縺ェ縺?¥縺帙↓include縺励∪縺上ｋ莠コ髢薙?繧ッ繧コ
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<list>
#include<deque>
using namespace std;
#define INF 1 << 20
#define MAX_B 101

int a, b, i, j, k, money[MAX_B][MAX_B], time[MAX_B][MAX_B], n, m, c, d;
bool judge;
stack<int> left, right;


int main(){
  scanf("%d %d", &n, &m);
  if(n == 0 && m == 0) return 0;
  for(i = 1; i <= n; i++){
    for(j = 1; j <= n; j++){
      money[i][j] = INF;
    }
  }
  for(i = 1; i <= n; i++){
    money[i][i] = 0;
  }
  for(i = 0; i < m; i++){
    scanf("%d", &a);
    if(a == 0){
      scanf("%d %d", &b, &c);
      if(money[b][c] == INF) printf("-1\n");
      else printf("%d\n", money[b][c]);
      continue;
    }
    scanf("%d %d %d", &b, &c, &d);
    if(money[b][c] > d){
      money[b][c] = d;
      money[c][b] = d;
      for(j = 1; j <= n; j++){
	money[j][c] = money[c][j] = min(money[j][c], money[j][b] + money[b][c]);
	money[j][b] = money[b][j] = min(money[j][b], money[j][c] + money[c][b]);
      }
    }
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <iterator>
using namespace std;

struct AboutTo;

class Node{
public:
	int aa;
	int Lowest;
	bool IsSelected;
	vector<AboutTo> ToCollection;
	Node(){
		Lowest = 2147483647;
		IsSelected = false;
	}
	void Reset(){
		Lowest = 2147483647;
		IsSelected = false;
	}
};
struct AboutTo{
	Node* To;
	int Cost;
	int Time;
};

int GetShortest(int a,const Node GoalNode, vector<Node> &aNodeCol, const int IsTime){
	aNodeCol[a].IsSelected = true;
	int TempMin = 2147483647;
	int aNode;
	for (auto i = aNodeCol.begin(); i != aNodeCol.end(); ++i){
		if ((*i).IsSelected){
			for (auto j = (*i).ToCollection.begin(); j != (*i).ToCollection.end(); ++j){
				if (!(*((*j).To)).IsSelected){
					if (IsTime){
						if (TempMin>(*i).Lowest + (*j).Time){
							TempMin = (*i).Lowest + (*j).Time;
							aNode = (*((*j).To)).aa;
						}
					}
					else{
						if (TempMin>(*i).Lowest + (*j).Cost){
							TempMin = (*i).Lowest + (*j).Cost;
							aNode = (*((*j).To)).aa;
						}
					}
				}
			}
		}
	}
	if (aNode != GoalNode.aa){
		aNodeCol[aNode].Lowest = TempMin;
		return GetShortest(aNode, GoalNode, aNodeCol, IsTime);
	}

	return TempMin;
}

int main(){
	int n, m;
	cin >> n >> m;
	static vector<Node> NodeCollection;
	for (int i = 0; i < m; ++i){
		Node aNode;
		aNode.aa = i;
		NodeCollection.push_back(aNode);
	}
	for (int i = 0; i < n; ++i){
		int a, b, cost, time;
		cin >> a >> b >> cost >> time;
		NodeCollection[a - 1].ToCollection.push_back({ &NodeCollection[b - 1], cost, time });
		NodeCollection[b - 1].ToCollection.push_back({ &NodeCollection[a - 1], cost, time });
	}
	int k;
	cin >> k;
	for (int i = 0; i < k; ++i){
		int p, q, r;
		cin >> p >> q >> r;
		NodeCollection[p - 1].Lowest = 0;
		cout << GetShortest(p - 1,NodeCollection[q-1], NodeCollection, r) << endl;
		for (auto i = NodeCollection.begin(); i != NodeCollection.end(); ++i){
			(*i).Reset();
		}
	}
	cin >> k >> k;
	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
#define M 2100000
using namespace std;	
int main(void)
{
	int i,j,n,k,m,a[3001],b[3001],cost[3001],time[3001],kk,pp,bre;
	int p,q,r;
	int kin[101][101],zi[101][101];
	int flg[10001],leng[10001],min;
	int kaku,skin,szi;
	
	while(1) {
		scanf("%d %d",&n,&m);
		if(n==0 && m==0) break;
		for(i=1;i<=n;i++) scanf("%d %d %d %d",&a[i],&b[i],&cost[i],&time[i]);
		//??£??\????????????  ??????
		for(i=1;i<=m;i++) {
			for(j=1;j<=m;j++) {
				kin[i][j]=M;
			}
		}
		for(i=1;i<=m;i++) kin[i][i]=0;
		for(i=1;i<=n;i++)	kin[a[i]][b[i]]=cost[i];
		for(i=1;i<=n;i++)	kin[b[i]][a[i]]=cost[i];
		//??£??\???????????????
		for(i=1;i<=m;i++) {
			for(j=1;j<=m;j++) {
				zi[i][j]=M;
			}
		}
		for(i=1;i<=m;i++) zi[i][i]=0;
		for(i=1;i<=n;i++) zi[a[i]][b[i]]=time[i];
		for(i=1;i<=n;i++) zi[b[i]][a[i]]=time[i];
		scanf("%d",&k);
		for(i=1;i<=k;i++) {
			scanf("%d %d ",&p,&q);
			scanf("%d",&r);
			for(j=1;j<=m;j++) {
				leng[j]=M;
				flg[j]=0;
			}
			leng[p]=0;
			if(r==0) {
				for(j=1;j<=m;j++) {
					min=M;
					for(kk=1;kk<=m;kk++) {
						if(flg[kk]==0 && leng[kk]<min) {
							kaku=kk;
							min=leng[kk];
						}
					}
					flg[kaku]=1;
					for(kk=1;kk<=m;kk++) {
						if((leng[kaku]+kin[kaku][kk])<leng[kk]) leng[kk]=leng[kaku]+kin[kaku][kk];
					}
				}
				printf("%d\n",leng[q]);
			}
			else {
				for(j=1;j<=m;j++) {
					min=M;
					for(kk=1;kk<=m;kk++) {
						if(flg[kk]==0 && leng[kk]<min) {
							kaku=kk;
							min=leng[kk];
						}
					}
					flg[kaku]=1;
					for(kk=1;kk<=m;kk++) {
						if((leng[kaku]+zi[kaku][kk])<leng[kk]) leng[kk]=leng[kaku]+zi[kaku][kk];
					}
				}
				printf("%d\n",leng[q]);
			}
		}
		/*
			//cost
		printf("??????\n");
		printf("      ");
		for(i=1;i<=m;i++) printf("%7d ",i);
		printf("\n");
		printf("\n");
		for(i=1;i<=m;i++) {
			printf("%7d  ",i);
			for(j=1;j<=m;j++) {
				printf("%7d ",kin[i][j]);
			}
			printf("\n");
		}
		printf("\n");
		printf("\n");
		//time
		printf("??????\n");
		printf("      ");
		for(i=1;i<=m;i++) printf("%7d ",i);
		printf("\n");
		printf("\n");
		for(i=1;i<=m;i++) {
			printf("%7d  ",i);
			for(j=1;j<=m;j++) {
				printf("%7d ",zi[i][j]);
			}
			printf("\n");
		}
		printf("\n");*/
	}
		return 0;
}