Is there a built-in function to compute ALL the Hamiltonian cycles in a graph?
The function hamiltonian_cycle only computes one Hamiltonian cycle of a graph, how can we compute all the cycles if there are more than one.
Which is exactly the question? The one in the title, which is strictly speaking a sage question, and the answer is no, looking at the methods of some specific instance of the example graph
G = graphs.CubeGraph(3). Or the one in the short post, where we have a soft question "How can we compute all (Hamiltonian) cycles?" - and please show us the own efforts, and/or give references for some algorithm, and/or declare an explicit graph of interest...