#14528: Additional doctests for the graph module
---------------------------------+------------------------------------------
Reporter: azi | Owner: tbd
Type: PLEASE CHANGE | Status: needs_review
Priority: major | Milestone: sage-5.10
Component: PLEASE CHANGE | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
Hmmmmmm... This is still very long `:-/`
{{{
sage: g = graphs.RandomBipartite(7,7,0.7)
sage: %time g.line_graph().is_perfect()
CPU times: user 104.32 s, sys: 0.07 s, total: 104.39 s
Wall time: 104.86 s
True
}}}
Could you make the graph smaller, or at the very list add a "# long time"
flag to those two lines ?
By the way, perhaps it could make sense now to add some code in
`is_perfect` to check if the graph is the line graph of a bipartite
graph... As we can now compute the root graph `:-P` I wonder what the
performances would be `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14528#comment:14>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
