#12743: Addition of reduction rules as pre-processing of the vertex cover
function
---------------------------------+------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
Helloooooooooooo !!!
Here is what this patch does :
* avoid copying G for nothing when the reduction rules are not used (which
is the case by default)
* uses the graph's structure instead of doing the same job with
dictionaries
* several caches or small optimizations, or shortenings.
* a small amount of comments in the code
* moved a whole block of code back to the original indentation level (the
main code was indented because of a test "if g.order() == 0"...)
This being said, since your last version the "good sides" of the "cores"
algorithm are used ! The list of vertices of small degree is not rebuilt n
times but generated on the fly, so that only vertices whose degree has
changed are checked `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12743#comment:11>
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.
