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 Solvers30
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1394 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1037 Solvers
-
Project Euler: Problem 10, Sum of Primes
1645 Solvers
-
1265 Solvers
-
Area of an equilateral triangle
5815 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!