Problem 1478. Hamiltonian Cycle
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 commentsProblem Recent Solvers32
Suggested Problems
-
The Hitchhiker's Guide to MATLAB
3276 Solvers
-
Is my wife right? Now with even more wrong husband
1319 Solvers
-
Program an exclusive OR operation with logical operators
707 Solvers
-
103 Solvers
-
Number of Even Elements in Fibonacci Sequence
1261 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!