is_at_free(G)
The method uses the find_asteroidal_triple
method to recognize an AT-free graph. If no asteroidal triple is found the graph is AT-free and True is returned. If at least one asteroidal triple is found the graph is not AT-free and False is returned.
The graph to check whether is AT-free or not.
True if G is AT-free and False otherwise.
Check if a graph is AT-free.
>>> G = nx.Graph([(0, 1), (0, 2), (1, 2), (1, 3), (1, 4), (4, 5)])
... nx.is_at_free(G) True
>>> G = nx.cycle_graph(6)See :
... nx.is_at_free(G) False
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.asteroidal.is_at_free
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