> > there is subgraph_search_iterator() > which might not be optimized for cycles too much, but does the job, I > guess: >
+1. That's the easiest way to get them. If performance is a problem you may want to work a bit more on the exploration algorithm, but if you do so do not overestimate what speed you could gain this way: there is no magical way to compute a TSP, and no magical way to get them all either. Just be careful when using the subgraph_search_iterator() function, as you will get every cycle on 'n' vertices for a total of 2n times. Nathann -- 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.
