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

rifat

13 solvers

0 likes

Solve

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

48 Solutions

Last Solution submitted on May 28, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers13

Suggested Problems

Select every other element of a vector

37114 Solvers
Return a list sorted by number of occurrences

2899 Solvers
Factorize THIS, buddy

1750 Solvers
Sum of first n positive integers

629 Solvers
Flip the bit

544 Solvers

More from this Author44

longest common substring : Skipped character version

57 Solvers
Cat, Meowcat and Concatenation

66 Solvers
FIFA World Cup 2014 : Offside

16 Solvers
possible ways through matrix

37 Solvers
Let's see how peculiar we can get

199 Solvers

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!