On Thursday, December 14, 2017 at 11:29:33 AM UTC, Antonio Rojas wrote: > > El Thu, 14 Dec 2017 11:09:17 +0000, Vincent Delecroix escribió: > > > What about > > > > sage: A = networkx.complete_bipartite_graph(2r, 3r) > > That works correctly: > > sage: A=networkx.complete_bipartite_graph(2r,3r) > sage: list(A.edges()) > [(0, 2), (0, 3), (0, 4), (1, 2), (1, 3), (1, 4)] >
Great, thanks, Vincent! I have created https://trac.sagemath.org/ticket/24374 to track the updating. -- 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.
