Given a graph as an adjacency matrix, calculate the total number of distinct simple cycles.
Remember that is not the same as , and that is the same as .
, the number of vertices.
The adjacency matrix - rows of numbers.
The first row represents the first vertex, and similarly the last row represents the last vertex.
The number of distinct simple cycles of any length.
3 0 1 0 0 0 1 1 0 0