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
-
Output any real number that is neither positive nor negative
411 Solvers
-
Implement a bubble sort technique and output the number of swaps required
398 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
960 Solvers
-
528 Solvers
-
Find out sum of all elements of given Matrix
538 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!
