Count all cycles size 3 to 9 in simple undirected graph

Counts all cycles size 3 to 9 in simple undirected graph, using pruned combinatorial enumerations.

Counts all cycles of size 3 to 9 in input graph, using a pruned combinatorial enumeration specific for each size cycle. Designed for undirected graphs with no self-loops or multiple edges. Outputs count of each size cycle from 3 up to 9.

Algorithm is guaranteed to find each cycle exactly once.

Reads input graph using separate m-file readGraph.m, which supports reading a graph from a file or workspace array in four different formats. A test file for each format is included.

In practice this algorithm is considerably faster than the algorithm previously posted by the same author (cycleCountBacktrack.m), even when the size limit for the latter is set to 9.