This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.


Cycle finding algorithms

cycle_basis(G[, root]) Returns a list of cycles which form a basis for cycles of G.
simple_cycles(G) Find simple cycles (elementary circuits) of a directed graph.
find_cycle(G[, source, orientation]) Returns the edges of a cycle found via a directed, depth-first traversal.