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
-
Return the largest number that is adjacent to a zero
5516 Solvers
-
1839 Solvers
-
Determine if input is a perfect number
261 Solvers
-
315 Solvers
-
Who has power to do everything in this world?
485 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!
