Recent content by mm84010

Thanks Stephen, I had implemented the algorithm and it works fine. I am trying to put a nice formula in my report to reflect this algorithm.

Hi, I am seeking help to derive my formula in set theory. I will explain my request through the following example: suppose I have this transitive relation R = { (1,2), (2,3), (3,5), (5,7), (3,4) } I mean by transitive that since (1,2) ==> 1 > 2, and (2,3) ==> 2 > 3 then I can conclude...

Sorry, Math is not my suppject, but this is how I understand transitive relation: if A > B and B > C then A > C. In my example I have , e.g., - (1,2) = 1 > 2 - (2,3) = 2 > 3 which conclude that 1 > 3 ==or==> (1,3) from this new pair I can create another two pairs - (1,3) - (3,5) & (3,4)...

Hi, I have a transitive relation and wana build a complete set of pairs that reflect all (direct/indirect) relations among the pairs. Ex.: suppose I have this relation R = { (1,2), (2,3), (3,5), (5,7), (3,4) } I wana to produce this relation R oper R = { (1,2), (1,3), (1,4), (1,5)...