Given a graph as an adjacency matrix, calculate the total number of
distinct simple cycles.
Remember that ~A - B - C - A~ is not the same as ~A - C - B - A~, and that ~A - B - A~ is the same as ~B - A - B~.
...same as before.
~N \le 10~.
The number of distinct simple cycles of any length.
3 0 1 0 0 0 1 1 0 0