there is subgraph_search_iterator() which might not be optimized for cycles too much, but does the job, I guess:
sage: p=graphs.HeawoodGraph(); p Heawood graph: Graph on 14 vertices sage: c=graphs.CycleGraph(14); c Cycle graph: Graph on 14 vertices sage: len(list(p.subgraph_search_iterator(c))) 672 On Saturday, February 6, 2016 at 7:16:31 AM UTC, Christian Stump wrote: > > Hi there, > > is the functionality to get *ALL* hamiltonian cycles in a graph somehow > already available in Sage? (Mathematica provides that, > http://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html, > > but I would prefer not to pay for each hamiltonian cycle I am offered by my > computer...) > > Thanks, Christian > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
