Problem 2458. Graph Algorithms - 1 : Length of the largest closed path
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 commentsProblem Recent Solvers11
Suggested Problems
-
Project Euler: Problem 2, Sum of even Fibonacci
2248 Solvers
-
Put two time series onto the same time basis
321 Solvers
-
630 Solvers
-
318 Solvers
-
272 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!