Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Created by rifat

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>An undirected simple graph is given as the form of an adjacency matrix. Find the length of the largest closed path (one that starts and ends in same vertex). Here, length is defined as the number of the vertices included in the path. Assume that the solution is unique.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Definition of adjacency matrix :</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>http://en.wikipedia.org/wiki/Adjacency_matrix</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>"}]}

Solve

Solution Stats

32 Solutions
6 Solvers

Last Solution submitted on Apr 30, 2021

Last 200 Solutions

Solution Comments

Solution 566755

1 Comment

1 Comment

Jan Orwat on 27 Jan 2015

more test cases needed

Solution 563738

2 Comments

2 Comments

Alfonso Nieto-Castanon on 23 Jan 2015

unless I am misunderstanding, y_correct should be 2 for test #2 (e.g. path 1-2-1)

rifat on 27 Jan 2015

Yes. I corrected it. Thanks :)

Problem Recent Solvers6

Problem Tags

graph theory

Community Treasure Hunt

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

Start Hunting!

Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers6

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers6

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

Players