#8922: induced subgraph search
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.4.2
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
This patch add to Sage the method Graph.induced_subgraph_search which
looks for a given graph as an induced subgraph of "self".
This is done through exhaustive search, using a very basic new graph class
hand-made to efficiently stand such repetitive operations !
I tried to document the code so that it could be somewhat easy to review,
but feel free to ask any question about it ! :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8922>
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.
