Warshell算法判断传递包，包括自反包，对称包的函数

#include <iostream> #include <stdio.h> #include <string> #include <stdlib.h> using namespace std; bool func(char **M,int n) { int i; for(i = 0;i < n;i++) { if(M[i][i] == '0') return false; } return true; } bool symmertry(char **M,int n) { int i,j; for(i = 0;i < n;i++) for(j = 0;j < n;j++) { if(M[i][j] != M[j][i]) return false; } return true; } bool translate(char **M,int n) { int i,j,k; bool flag; flag = true; for(i = 0;i<n&&flag;i++) { for(j = 0;j<n&&flag;j++) { if(M[i][j]=='1') { k = 0; while(k<n) { if((M[i][k]=='1'&&M[k][j]=='1')||(M[k][i]=='1'&&M[k][j]=='1')||(M[i][k]=='1'&&M[j][k]=='1')||(M[k][i]=='1'&&M[k][j]=='1')) { break; } else k++; } if(k==n) { flag = false; } } } } if(i == n) return true; else return false; } int main() { char **M; int vexnum,i,j; bool flag; cout <<endl<<endl<<"请输入关系矩阵的vertexnum:"; cin >> vexnum; M = new char *[vexnum]; for(i = 0;i < vexnum;i++) { M[i] = new char[vexnum]; } cout << endl << endl << "请输入关系矩阵：" << endl << endl; while(true) { flag = true; for(i = 0;i < vexnum && flag;i++) { for(j = 0;j < vexnum;j++) { cin >> M[i][j]; if(M[i][j] != '0' && M[i][j] != '1') { cout << endl << "输入不正确，请重新输入！" << endl << endl; flag = false; break; } } } if(i == vexnum && j == vexnum) break; } if(func(M,vexnum) && symmertry(M,vexnum)) { cout << "R是对称关系！" << endl; } else cout << "R不是对称关系！" << endl; if(translate(M,vexnum)) cout<<"R是传递关系！"<<endl; else cout<<"R不是传递关系！"<<endl; return 0; }