#8922: induced subgraph search
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: critical | Milestone: sage-4.4.3
Component: graph theory | Keywords:
Author: Nathann Cohen | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Comment(by ncohen):
Hello !!
Well, first thank you for your work on this patch... I know it's a bit
heavy all at once, and I hope the comments were clear enough :-)
About the ``adjacency_list`` method : I was more worried about speed than
storage, but anyway DenseGraph were faster than my matrix of integers..
Don't you think working on integers as it is done inside of DenseGraph
could be more efficient than it currently is ? I have never used
operations such as << and >> as it is done in DenseGraph, but I thought it
would be the next step if one wanted to improve the speed for a bit. I'll
trust you on this one !
I also took some notes for future improvements... For example several
tricks to reduce the number of attempts, or the initial graph, but I
intended to wait for this patch to be merged before adding them. It will
be easier to read in another one anyway :-)
Thank you again
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8922#comment:5>
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.
