#9420: SubgraphSearch class instead of a method, digraphs fixed
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.5
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Hello !!
This patch implements the class SubgraphSearch, which enables one to look
for copies of a small graph in a larger one, which is exactly what the
method subgraph_search previously did (#8922).
The code is simply inserted inside a new class, with a few other methods
to iterate over the occurences, or to count them !
This could have been done with a simple "yield" in Cython, though we may
not want to wait until they are implemented ;-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9420>
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.
