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
-
How to find the position of an element in a vector without using the find function
2818 Solvers
-
Return a list sorted by number of consecutive occurrences
437 Solvers
-
580 Solvers
-
140 Solvers
-
Sum the 'edge' values of a matrix
404 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!
