symbolic_dynamics.sofic.
is_irreducible
Returns True iff G is irreducible
A graph is irreducible if for any two vertices in G, there is a path between them. Synonymous with strongly connected.