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

49 Solutions

14 Solvers

Last Solution submitted on Aug 17, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers14

Chris Cleveland George Berken ChrisR David Hill

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!