Cody

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

Solve

Solution Stats

32.0% Correct | 68.0% Incorrect
Last Solution submitted on Nov 28, 2018

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author44

Problem Tags

graph theory