/* Special Thanks to gordie for helping me improve the Assign Functions for a general Input. Now, inputs are no longer rigid as before! A program to determine if a Relation defined on a Set A is Relfexive or not, Symmetric or not, or Transitive or not. Input Requirement - The Set A and the Relation Set R, in newlines. Sample Input - : *) For the Set - 1 2 3 4\n *) For the Relation - (1,2) (3,4)\n Sample Run - : Enter the Domain Set (Nos. Separated by Spaces)(Press ENTER when Done) - 1 2 Your Domain Set - {1,2} Enter the Relation Set (Pairs inside braces)(Press ENTER when Done) - (1,1) (1,2) (2,1) (2,2) Your Relation Set - {(1,1),(1,2),(2,1),(2,2)} Checking the Relation Set - Reflexive ? - true Symmetric ? - true Transitive ? - true */ #include #include #include #include #include #include using namespace std; typedef pair RSet[1000]; typedef int Set[1000]; int ToInt(string d) { int i; stringstream res(d); res>>i; return i; } void Assign(string Data, Set a,int& size) { int n = 0; size_t b = 0; size_t e = 0; string sub = ""; for(size_t i=0;i b) { a[n] = ToInt(Data.substr(b,e-b)); n++; b = e; } } size = n; } void Assign(string Data, RSet r,int& size) { int n = 0; string sub = ""; bool st = 0; int cm = 0; for(size_t i=0;i elm) { if(find(r,r+rs,elm)!=r+rs) return true; return false; } bool Reflexive(RSet r,Set a,size_t rs,size_t as) { RSet rflx; int size = 0; for(size_t i=0;i AB,BC,AC; for(int i=0;i

Determination of a Relation's Type