Problem 1478. Hamiltonian Cycle

G K

38 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

85 Solutions

Last Solution submitted on Feb 13, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers38

Suggested Problems

All capital?

661 Solvers
Numbers with prime factors 2, 3 and 5.

681 Solvers
Perimeter

154 Solvers
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)

902 Solvers
Write a function man that takes a row vector v and returns a matrix H as follows..

646 Solvers

More from this Author10

Number of paths on a grid

80 Solvers
Champernowne Constant

94 Solvers
Method of Common Differences part-1

57 Solvers
Conjunctive Normal Form

17 Solvers
Method of Common Differences part-2

25 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!