Problem 1478. Hamiltonian Cycle

G K

41 solvers

2 likes

Solve

Solve Later

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

88 Solutions

Last Solution submitted on Aug 04, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers41

Suggested Problems

vectorization in N

289 Solvers
Who knows the last digit of pi?

692 Solvers
Is A the inverse of B?

1434 Solvers
Set the array elements whose value is 13 to 0

1460 Solvers
Implement a bubble sort technique and output the number of swaps required

404 Solvers

More from this Author10

Method of Common Differences part-2

27 Solvers
Number of cyles and fixed points in a permutation

40 Solvers
Index of a Rational number

121 Solvers
Champernowne Constant

98 Solvers
Number of paths on a grid

83 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!