Question: I need to write a program that implements this Algorithm (image below) on C++. It needs to accept binary matricies from std in and it
I need to write a program that implements this Algorithm (image below) on C++. It needs to accept binary matricies from std in and it needs to prove whether it is a equvalence
relation (whether the set is transitive, reflexive and symmetric )or not. I am not allowed to use libraries but can use vector.
Transitive Closure Algorithm 1 : A Procedure for Computing the Transitive Closure procedure transitive closure (MR :zero-one nxn matrix) A := MR B: A for i:-2 to n begin A: AOMR end (B is the zero-one matrix for R* ) Transitive Closure Algorithm 1 : A Procedure for Computing the Transitive Closure procedure transitive closure (MR :zero-one nxn matrix) A := MR B: A for i:-2 to n begin A: AOMR end (B is the zero-one matrix for R* )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
