#12155: Bug when taking complement of bipartite graph.
----------------------------+-----------------------------------------------
Reporter: fidelbarrera | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: graph theory | Keywords: bipartite, complement
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Comment(by rbeezer):
Nathann,
Looks good. Testing right now. What do you think of adding something to
the TESTS section for each graph that keeps somebody from thinking it
would be cool to change these constructions back to returning
{{{BipartiteGraph}}} instances? Just build one and take the complement
with a reference to this ticket. I guess this is where a test suite would
help - taking the complement in the test suite would keep somebody from
ever making a new construction like these.
Is there someplace that shows how to convert a plain graph into a
bipartite graph? (I have not looked.) In other words
{{{
G = graphs.CompleteBipartiteGraph(3, 4)
H = BipartiteGraph(G)
}}}
Or maybe a way to do the conversion by giving the partition, so that there
is no real computation to find it? If there are any methods for the
BipartiteGraph class which are specialized for that situation, it'd be
good to document how to easily get to those. Lots of travel for the next
5 weeks, but I'll try to stay with this one.
Rob
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12155#comment:4>
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.
