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

3 次查看（过去 30 天）
Chrisialy Leicah
Chrisialy Leicah 2024-3-16
回答： Torsten 2024-3-16
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.

请先登录，再回答此问题。

回答（1 个）

Torsten
Torsten 2024-3-16
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

类别

在 Help Center 和 File Exchange 中查找有关 Networks 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by