On 2012-07-06 09:41, Birk Eisermann wrote: > To me, BipartiteGraph(n) does not make sense. It is a graph without > edges. Trying to find out to which partition class vertex 0 belongs to > (G=BipartiteGraph(3); G.<tab>) I was struck by this immense list of more > than 270 functions. I found that G.Bipartition() will do the job. > Surprisingly (or not) all vertices belong to one class and the other is > empty. For me, BipartiteGraph(k,l) would be more natural (maybe with the > convertion that the first partition class contains vertices 0,1,...,k-1, > and the second class k,k+1,...,k+l-1).
Absolutely +1. A BipartiteGraph object should not just be a graph which happens to be bipartite. The BipartiteGraph object should have additional structure, namely the vertex partition. As pointed out, this immediately solves the problem of adding edges. -- -- 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
