Counting CyclesGiven 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.
Input.. Same as before.
N ≤ 10.
OutputThe number of distinct simple cycles of any length.
3 0 1 0 0 0 1 1 0 0
Point Value: 10
Time Limit: 2.00s
Memory Limit: 16M
Added: Jun 28, 2013
- Graph Theory
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3