The next few exercises ask you to implement relations (and the standard relation
operations) in a programming language of your choice. Don’t worry too much about
efficiency in your implementation; it’s okay to run in time Θ(n
3), Θ(n4) or even
Θ(n5) when relation R is on a set of size n.
(programming required) Develop a basic implementation of relations on a set A. Also implement inverse (R−1) and composition (R ◦ T,
where both R and T are subsets of A × A).
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here