Graph Algorithms - 1 : Length of the largest closed path - MATLAB Cody - MATLAB Central

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

Difficulty:
(30)
Rate

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

36.96% Correct | 63.04% Incorrect
Last Solution submitted on Nov 02, 2024

Solution Comments

Show comments
Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025
...
Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers12

Suggested Problems

More from this Author44

Problem Tags

graph theory

Community Treasure Hunt

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

Start Hunting!
Go to top of page