This documents the development version of NetworkX. Documentation for the current release can be found here.
Returns True if
A directed graph is aperiodic if there is no integer k > 1 that divides the length of every cycle in the graph.
- GNetworkX DiGraph
A directed graph
True if the graph is aperiodic False otherwise
Gis not directed
This uses the method outlined in , which runs in \(O(m)\) time given \(m\) edges in
G. Note that a graph is not aperiodic if it is acyclic as every integer trivial divides length 0 cycles.
Jarvis, J. P.; Shier, D. R. (1996), “Graph-theoretic analysis of finite Markov chains,” in Shier, D. R.; Wallenius, K. T., Applied Mathematical Modeling: A Multidisciplinary Approach, CRC Press.