> > However, in either case it seems very inefficient to create all of the > original edges, just to turn around and destroy them all right away. > I'm not finding a method that converts a BipartiteGraph into a Graph > with very little overhead. Maybe the present example illustrates the > need for such a thing. > Oh, I answered on the other thread :
https://groups.google.com/forum/#!topic/sage-devel/UrPU-0xzzGc Well, I'd vote for the solution : "do not return BipartiteGraph instances when not explicitely asked", as is the case here. When a bipartite graph is created nothing ensures that the user wants to keep it this way, and even though he may some methods inherited by BipartiteGraph class may not think about it the same way. Nathann > -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
