Hamiltonian Cycle - MATLAB Cody - MATLAB Central

Problem 1478. Hamiltonian Cycle

Difficulty:
(1363)
Rate
This is related to the Travelling Salesman Problem 1339 created by Alex P.
A Hamiltonian cycle or traceable cycle is a path that visits each vertex exactly once and returns to the starting vertex.
Given an Adjacency Matrix A, and a tour T, determine if the tour is Hamiltonian, ie a valid tour for the travelling salesman problem.
A is a matrix with 1 and 0 indicating presence of edge from ith vertex to jth vertex. T is a row vector representing the trip containing list of vertices visited in order. The trip from the last vertex in T to the first one is implicit.
Problem 4) Prev: 1477 Next: 1481
Solve

Solution Stats

57.5% Correct | 42.5% Incorrect
Last Solution submitted on Mar 18, 2025

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers33

Suggested Problems

More from this Author10

Problem Tags

math traveling salesman

Community Treasure Hunt

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

Start Hunting!