Problem 1170. Count the Number of Undirected Cycles in a Graph
Solution Stats
Problem Comments

4 Comments
could you please clarify, in your example, why cycles like '1>2>1', '1>5>1' or '3>5>3' are not counted?
it seems the expected solution only counts cycles that include three or more nodes... is this correct?
That is correct. In a directed graph, the cycle 1 > 2 > 1 actually uses two different edges, while in an undirected graph, the edge 1 > 2 and 2 > 1 are one and the same. I am only considering cycles valid if each node along the way is visited once and if edges are not used more than one time. I chose this criteria so that the number of cycles counted would match the results for the table provided here: http://mathworld.wolfram.com/GraphCycle.html
got it. Thanks for the clarification!
Solution Comments
Show commentsProblem Recent Solvers18
Suggested Problems

9834 Solvers

393 Solvers

433 Solvers

What is Sum Of all elements of Matrix
402 Solvers

Number of Even Elements in Fibonacci Sequence
1254 Solvers
More from this Author3
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!