Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Created by rifat

Solve Later

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

Solve

Solution Stats

Last solution submitted on Nov 28, 2018

Last 200 Solutions

Solution Comments

Solution 566755

1 Comment

1 Comment

Jan Orwat on 27 Jan 2015

more test cases needed

Solution 563738

2 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

Problem Tags

graph theory

Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author45

Problem Tags

Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author45

Problem Tags

Players