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

Project Euler: Problem 2, Sum of even Fibonacci

2915 Solvers
Bottles of beer

2280 Solvers
Back to basics 20 - singleton dimensions

279 Solvers
Set the array elements whose value is 13 to 0

1458 Solvers
Area of a disk

381 Solvers

More from this Author44

all possible subsets of set

28 Solvers
possible ways through matrix

37 Solvers
Graph Algorithms 3: Number of Connected Components

58 Solvers
Mongean Shuffle : 2

70 Solvers
Determine connected components of a graph

86 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!