-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathques4.cpp
86 lines (77 loc) · 2.24 KB
/
ques4.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <iostream>
using namespace std;
class Relation{
public:
// Members of class
bool** matrix;
int n; // order - n
Relation(int side){
n = side;
this->matrix = new bool*[side];
for (int i = 0; i < side; i++){
this->matrix[i] = new bool[side];
for (int j = 0; j < n; j++){
cin >> this->matrix[i][j];
}
}
}
bool is_reflexive(){
for (int i = 0; i < n; i++){
if (!matrix[i][i]){
return false;
}
}
return true;
}
bool is_symmetric(){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if (j>i && !matrix[i][j])
return false;
else{
if (matrix[i][j] != matrix[j][i])
return false;
}
}
}
return true;
}
bool is_transitive(){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if (matrix[i][j]){
for (int k = 0; k < n; k++){
if (matrix[j][k]){
if (matrix[i][k])continue;
return false;
}
}
}
}
}
return true;
}
bool is_antisymmetric(){
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if (j>i && matrix[i][j] == matrix[j][i]) return false;
}
}
return true;
}
bool is_equivalence(){
return (is_reflexive() && is_symmetric() && is_transitive());
}
bool is_partial_order(){
return (is_reflexive() && is_antisymmetric() && is_transitive());
}
};
int main(){
int n = 3;
Relation r(n);
cout << "Is relation equivalence? :";if(r.is_equivalence()==1) cout<<"Yes"; else cout<<"No";
cout << "\nIs relation Partially ordered? :";if(r.is_partial_order()==1) cout<<"Yes";else cout<<"No";
if(r.is_equivalence()==0 && r.is_partial_order()==0 ){
cout<<"\nNone";
}
}