#12917: is_cartesian_product
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: tbd
Type: PLEASE CHANGE | Status: new
Priority: major | Milestone: sage-5.1
Component: PLEASE CHANGE | Keywords:
Work issues: | Report Upstream: N/A
Reviewers: | Authors:
Merged in: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------------------------
This patch implements a new method that lets one recognize whether a graph
can be written as the cartesian products of some others. A new module is
created because the documentation is rather long, and because the first
aim was to write the method much more efficiently, at a much lower level.
As usual, the patch would be much harder to review if it were done all at
once, and we would need two versions anyway to check the correction of the
trickier algorithm.
The aim of this patch is also to obtain better plots of very symmetrical
graphs.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12917>
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.
