[Python] How can I find circular relations in a graph with Python and Networkx?

Consider I have the following graph:

A -> B
B -> C
C -> D
C -> A


What is the easiest way to find that A -> B -> C -> A is a circular relation? Is there such a function already built into NetworkX or another easy to use Python library?

Continue reading...