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

rifat

14 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

49 Solutions

Last Solution submitted on Aug 17, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers14

Suggested Problems

Determine whether a vector is monotonically increasing

23506 Solvers
Sort numbers by outside digits

163 Solvers
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)

266 Solvers
Find the maximum two numbers of every column of a matrix

234 Solvers
Determine the square root

801 Solvers

More from this Author44

BLOCK x3 (Version 2)

8 Solvers
weekday and month

78 Solvers
longest common substring : Skipped character version

57 Solvers
longest common semi-substring

57 Solvers
self description 2.0

16 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!