Warshall算法C++实现

#include "iostream"
#ifndef MAXSIZE
#define MAXSIZE 1000
#endif
using namespace std;
int matrix[MAXSIZE][MAXSIZE];
int size;
void getT(){
	cout<<"Input the element amounts:";
	cin>>size;
	cout<<"Input the matrix:"<>matrix[i][j];	
		}
	}
		for (int i=0;i

判断顺序很重要，扫描二元关系后项，判断前项，这样不会有漏网之鱼