#11994: Vertex separation and pathwidth in Sage
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.8
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author: Nathann Cohen
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Comment(by ncohen):
Hello Jason !
Well, there is actually not much bit-counting going on. :-)
I have to count bits very often in integers, hence the corresponding
function in the code, but most of the code is really graph theoretical. I
would have been glad to use bitsets (and I often do these days in Sage
patches), but the code was just faster when I stored a small integer for
each object, and not just a bit. So I'm using char * instead of bitsets
:-)
Thouh I'm a very, very good fan of bitsets in general. I just love this
thing :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11994#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.
