How do I code a Hamiltonian Cycle in an undirected weighted graph?

Is there a way that I can code a Hamiltonian Cycle? I have a list of nodes and its corresponding weighted edges. I wanted to find the shortest path from V1 which visits all nodes exactly once and goes back to the origin. However, I struggle to find any tutorials or examples for this problem. Also, does R2023b not support a command of "hamiltonian"? Please help. Thank you.

Answer 1

[Torsten]

I didn't test it yet, but maybe this one from the File Exchange:

https://uk.mathworks.com/matlabcentral/fileexchange/51610-hamiltonian-graph-source-destination