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
unless I am misunderstanding, y_correct should be 2 for test #2 (e.g. path 1-2-1)
Yes. I corrected it. Thanks :)
17153 Solvers
158 Solvers
Reverse the elements of an array
562 Solvers
214 Solvers
203 Solvers
Solution 566755
more test cases needed