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
-
7263 Solvers
-
Change the sign of even index entries of the reversed vector
644 Solvers
-
433 Solvers
-
Find the index of n in magic(n)
272 Solvers
-
Deleting an element in a matrix
491 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!
