Pedro Patricio wrote: > ok, let me remake my question: how can i define a boolean matrix? > sure it is not over a ring, but in fact over a semi-ring. > let me quote a previous post: > "the key thing is to compute the reachability matrix of a digraph. an > awkward way to do it would be by computing the power series A+A^2+ > \dots > +A^n, where n is the #vertices and A adjacency matrix, and replace > every nonzero element by 1." > > so, that seems to be not a several-lines command on sage. > > i submitted this to sage-edu because this came from my effort on > pushing sage in my university, on a very specific class. but giving it > a second thought, this should have gone to the sage-supp. sorry about > that. > > pedro > >
See my post on sage-support for a much better way (I think) of doing this, if I understand what you want to do correctly. Thanks, Jason --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sage-edu" group. To post to this group, send email to sage-edu@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-edu?hl=en -~----------~----~----~----~------~----~------~--~---
