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
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers13
Suggested Problems
-
832 Solvers
-
Return the first and last characters of a character array
12266 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
265 Solvers
-
487 Solvers
-
381 Solvers
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!
