Write a program that is able to list the following properties of binary relations:
In this exercise, by convention, we deal with relations over the finite set of natural numbers from 0 to n1.
Input will consist of several relations declared either as a matrix or as a set of ordered pairs.
Each matrix declaration begins with a line
containing the word matrix
and number n
indicating the size of the domain and codomain.
This is followed by n lines with a matrix representation.
Each list declaration begins with a line
containing the word list
and number n.
This is followed by zero or more lines
with the ordered pairs of the relation
followed by a line containing a dash 
.
For each relation given in the input output should contain a list of properties found in the given relation followed by a blank line.
matrix 3
0 1 1
0 0 1
0 0 0
list 4
0 0
1 1
2 2
3 3

irreflexive
antisymmetric
asymmetric
transitive
strict order
reflexive
symmetric
antisymmetric
transitive
equivalence
order
try first: relmember triangle
try also: relcomposition
try next: gcd
Copyright © 20202021 Rudy Matela
All rights reserved