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
-
2 Comments
Alfonso Nieto-Castanon
on 23 Jan 2015
unless I am misunderstanding, y_correct should be 2 for test #2 (e.g. path 1-2-1)
rifat
on 27 Jan 2015
Yes. I corrected it. Thanks :)
Problem Recent Solvers5
Suggested Problems
-
Replace NaNs with the number that appears to its left in the row.
1744 Solvers
-
113 Solvers
-
Duplicate each element of a vector.
461 Solvers
-
Vector of numbers divisible by 3
98 Solvers
-
437 Solvers
More from this Author44
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Solution 566755
more test cases needed