An undirected, unweighted graph of $8$ nodes and each edge of the graph is part of exactly one cycle. Find the number of possible graphs.