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 :)
4578 Solvers
Replace NaNs with the number that appears to its left in the row.
1620 Solvers
Given a window, how many subsets of a vector sum positive
642 Solvers
103 Solvers
254 Solvers
Solution 566755
more test cases needed