MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi test

Learn moreOpportunities for recent engineering grads.

Apply TodayThis 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.

22 correct solutions
9 incorrect solutions

Last solution submitted on Nov 01, 2015