Problem 1478. Hamiltonian Cycle

G K

40 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

87 Solutions

Last Solution submitted on May 25, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers40

Suggested Problems

Calculate the Levenshtein distance between two strings

1512 Solvers
Make a random, non-repeating vector.

11608 Solvers
Remove the two elements next to NaN value

710 Solvers
Special matrix

315 Solvers
Side of an equilateral triangle

7073 Solvers

More from this Author10

Index of a Rational number

120 Solvers
Number of cyles and fixed points in a permutation

39 Solvers
Method of Common Differences part-1

58 Solvers
Method of Common Differences part-2

26 Solvers
Game of Nim

38 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!