Thanks for your interest in Sage.
As you can see at the end of the wikipedia page, this is just a matrix
product followed by a truncation. And this easily done in Sage. Though
one might want a more efficient way than computing a product over Z to
get a {0,1}-matrix.
On 12/01/2018 00:00, Victor Porton wrote:
Composition of binary relations is defined at
https://en.wikipedia.org/wiki/Composition_of_relations
It seems that Sage does not provide a function to compose two finite binary
relations. Please add it.
Also note that posets (and other) are special cases of binary relations. So
please make Poset (and other relevant classes describing a binary relation)
a subclass of new class BinaryRelation.
Agree? (I am a very new Sage user and may be wrong.)
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
