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 Solvers12
Suggested Problems
-
Select every other element of a vector
36198 Solvers
-
Determine the number of odd integers in a vector
824 Solvers
-
425 Solvers
-
return row and column indices given 2 values which define a range
78 Solvers
-
Back to basics - mean of corner elements of a matrix
461 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!
