is_aperiodic(G)
A directed graph is aperiodic if there is no integer k > 1 that divides the length of every cycle in the graph.
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.
A directed graph
If G is not directed
True if the graph is aperiodic False otherwise
Returns True if G is aperiodic.
>>> DG = nx.DiGraph([(1, 2), (2, 1)]) >>> nx.is_aperiodic(DG) False
>>> DG = nx.DiGraph([(1, 2), (2, 3), (3, 1), (1, 4), (4, 1)]) >>> nx.is_aperiodic(DG) True
>>> DG = nx.DiGraph([(1, 2), (2, 1), (3, 4), (4, 5), (5, 6), (6, 3)]) >>> nx.is_aperiodic(DG) False
See :>>> DG = nx.DiGraph([(1, 2), (2, 3)]) >>> nx.is_aperiodic(DG) False
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.generators.lattice.grid_2d_graph
networkx.generators.lattice.grid_graph
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them