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

Learn moreOpportunities for recent engineering grads.

Apply TodayGiven a symmetric adjacency matrix, determine the number of unique **undirected** cycles.

For example, the graph represented by adjacency matrix

A = [ 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 1 0 1 0 0];

has 6 cycles. They are:

[1 -> 2 -> 3 -> 1] [1 -> 3 -> 5 -> 1] [2 -> 3 -> 4 -> 2] [1 -> 2 -> 4 -> 3 -> 1] [1 -> 2 -> 3 -> 5 -> 1] [1 -> 2 -> 4 -> 3 -> 5 -> 1]

The input is an adjacency matrix of 0s and 1s, and the output should be the number of unique (simple) undirected cycles in the graph.

3 correct solutions
1 incorrect solutions

Last solution submitted on Jul 14, 2014

4 Comments