networkx.algorithms.recursive_simple_cycles¶

networkx.algorithms.recursive_simple_cycles(G)[source]¶

Find simple cycles (elementary circuits) of a directed graph.

A simple cycle, or elementary circuit, is a closed path where no node appears twice. Two elementary circuits are distinct if they are not cyclic permutations of each other.

This version uses a recursive algorithm to build a list of cycles. You should probably use the iterator version called simple_cycles(). Warning: This recursive version uses lots of RAM!

Parameters:

G : NetworkX DiGraph

A directed graph

Returns:

A list of cycles, where each cycle is represented by a list of nodes

along the cycle.

Example:

>>> G = nx.DiGraph([(0, 0), (0, 1), (0, 2), (1, 2), (2, 0), (2, 1), (2, 2)])

>>> nx.recursive_simple_cycles(G)

[[0], [0, 1, 2], [0, 2], [1, 2], [2]]