#7904: is_gallai_tree
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Description changed by ncohen:
Old description:
> From the docstring :
> A graph is a Gallai tree if and only if it is connected and its
> `2`-connected components are all isomorphic to complete graphs or odd
> cycles.
>
> This patch also slightly touches the function is_clique, which was
> unnecessarily copying the whole graph 2 times :
> * Firstly, using the subgraph method
> * Secondly, using the to_simple method
New description:
From the docstring :
A graph is a Gallai tree if and only if it is connected and its
`2`-connected components are all isomorphic to complete graphs or odd
cycles.
This patch also slightly touches the function is_clique, which was
unnecessarily copying the whole graph 2 times :
* Firstly, using the subgraph method
* Secondly, using the to_simple method
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7904#comment:2>
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.
