#10959: BipartiteGraph adding edges between new nodes ignores partition
----------------------------+-----------------------------------------------
Reporter: rhinton | Owner: rhinton
Type: defect | Status: new
Priority: major | Milestone: sage-4.7
Component: graph theory | Keywords: bipartite graph
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
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.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10959>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
