Given an asymmetric adjacency matrix, determine the number of unique directed cycles.
For example, the graph represented by adjacency matrix
A = [
0 1 1 0;
1 1 0 1;
1 0 0 1;
1 1 0 0];
has 7 cycles. They are:
[2 -> 2]
[1 -> 2 -> 1]
[1 -> 3 -> 1]
[2 -> 4 -> 2]
[1 -> 2 -> 4 -> 1]
[1 -> 3 -> 4 -> 1]
[1 -> 3 -> 4 -> 2 -> 1]
The input is an adjacency matrix of 0s and 1s, and the output should be the number of unique (simple) directed cycles in the graph.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers46
Suggested Problems
-
Sum of diagonal of a square matrix
1646 Solvers
-
Set the array elements whose value is 13 to 0
1461 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
984 Solvers
-
802 Solvers
-
113 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!
