id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,work_issues,upstream,reviewer,author,merged,dependencies,stopgaps
10959,BipartiteGraph adding edges between new nodes ignores partition,rhinton,rhinton,"For example, 

{{{
sage: bg = BipartiteGraph()
sage: bg.add_edge(0,1)
sage: bg.left
set([])
sage: bg.right
set([])
}}}

Note that we can't really tell in general what the proper partitions for these new vertices are.  We can if *one* exists already.  The easy out in the former case is to throw an error.

There was some previous discussion about deciding partitions automatically.  Volunteers are welcome.  In the mean time, we should at least throw an error to avoid an invalid state.
",defect,closed,major,sage-5.0,graph theory,fixed,bipartite graph,brunellus jason,,N/A,Nathann Cohen,Lukáš Lánský,sage-5.0.beta2,,