Problem 1478. Hamiltonian Cycle

Created by G K

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This is related to the Travelling Salesman Problem</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1339\"><w:r><w:t>1339</w:t></w:r></w:hyperlink><w:r><w:t> created by</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/players/2336190-alex-p\"><w:r><w:t>Alex P</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Hamiltonian_cycle\"><w:r><w:t>Hamiltonian cycle</w:t></w:r></w:hyperlink><w:r><w:t> or traceable cycle is a path that visits each vertex exactly once and returns to the starting vertex.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given an</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Adjacency_matrix\"><w:r><w:t>Adjacency Matrix</w:t></w:r></w:hyperlink><w:r><w:t> A, and a tour T, determine if the tour is Hamiltonian, ie a valid tour for the travelling salesman problem.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Problem 4) Prev:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1477\"><w:r><w:t>1477</w:t></w:r></w:hyperlink><w:r><w:t> Next:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1481\"><w:r><w:t>1481</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This is related to the Travelling Salesman Problem <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1339">1339</a> created by <a href = "http://www.mathworks.com/matlabcentral/cody/players/2336190-alex-p">Alex P</a>.A <a href = "http://en.wikipedia.org/wiki/Hamiltonian_cycle">Hamiltonian cycle</a> or traceable cycle is a path that visits each vertex exactly once and returns to the starting vertex.Given an <a href = "http://en.wikipedia.org/wiki/Adjacency_matrix">Adjacency Matrix</a> 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: <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1477">1477</a>
Next: <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1481">1481</a>

Solve

Solution Stats

69 Solutions
26 Solvers

Last Solution submitted on Feb 11, 2021

Last 200 Solutions

Problem Comments

Problem Recent Solvers26

Problem Tags

math traveling salesman

Community Treasure Hunt

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

Start Hunting!

Problem 1478. Hamiltonian Cycle

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers26

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Problem 1478. Hamiltonian Cycle

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers26

Suggested Problems

More from this Author10

Problem Tags

Community Treasure Hunt

Players