Re: [sage-devel] complementary problem

2010-08-03 Thread Robert Miller
This entire problem is fixed by implementing proper comparison for Sage Sets: http://trac.sagemath.org/sage_trac/ticket/9677 -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to

Re: [sage-devel] complementary problem

2010-07-24 Thread Robert Miller
Chris, On Mon, Jul 12, 2010 at 7:49 PM, Chris Godsil cgod...@uwaterloo.ca wrote: ... its the complicated vertices that are causing the problem, I expect. The problem is that the comparison operators in Python for sets implement the subset notion, and thus do not provide a proper sorting of a

[sage-devel] complementary problem

2010-07-12 Thread Chris Godsil
If G is a graph and A = G.am() is its adjacency matrix and B = G.complement().am() is the adjacency matrix of its complement, then A+B should be a 01- matrix. The code below shows that sage does not always share this viewpoint. Cheers Chris # ##