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 Solvers14
Suggested Problems
-
3496 Solvers
-
Make a random, non-repeating vector.
11876 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
191 Solvers
-
Vector of numbers divisible by 3
154 Solvers
-
430 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!
