MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi test

Learn moreOpportunities for recent engineering grads.

Apply TodayGiven 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.

6 correct solutions
10 incorrect solutions

Last solution submitted on Jun 27, 2015

2 players like this problem