jorikjooken / longestcycles Goto Github PK

Hi,
Can your algorithm work for enumerating all different longest paths? Some literature refers to a longest path as a detour.

This program is excellent, but sometimes we not only need counting but also want to list some or all longest cycles. Can this program provide such an output? By the way, there's a sentence in the README.md that confuses me: This indicates that the graph is non-hamiltonian and has 4 pairwise distinct hamiltonian cycles.

I'm aware that you enumerate all the longest cycles. If I only want to obtain just one longest cycle for a given graph or its circumference (i.e. the length of the longest cycle), I'm wondering if your program can be made faster by some modifications, since you obtain all of them. Currently, I'm using solvers like integer programming.

In addition, There is indeed a program for the circumference on GitHub; see https://github.com/coldwarrior5/Graph-analyser/blob/master/longest-cycle/src/main.c, but unfortunately, its speed is not very fast.