Comment by apronchenkov

I recall that in a general case finding a hamiltonian cycle (or path) is already NP-complete. Although it should be a simple problem for small real graphs, what article suggests, I think, is to use a brute-force solution.

[1] https://mathworld.wolfram.com/HamiltonianPath.html