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.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers41
Suggested Problems
-
4520 Solvers
-
Find best placement for ordered dominoes (harder)
355 Solvers
-
Find out missing number from a vector of 9 elements
322 Solvers
-
117 Solvers
-
There are 10 types of people in the world
1411 Solvers
More from this Author10
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!