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.

Definition of adjacency matrix : http://en.wikipedia.org/wiki/Adjacency_matrix

Solve

Solution Stats

48 Solutions

13 Solvers

Last Solution submitted on May 28, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers13

Chris Cleveland ChrisR David Hill Athi

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

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

Start Hunting!