symbolic_dynamics.sofic.is_follower_separated

symbolic_dynamics.sofic.is_follower_separated(G)

Returns True iff G is follower-separated.

A deterministic labeled graph G if no two distinct vertices are follower-equivalant.

Parameters

Gdeterministic labeled graph

See also

get_follower_equivalences()

reduce()

Examples

>>> G = nx.MultiDiGraph()
>>> G.add_edge(1, 3, label="a")
>>> G.add_edge(2, 3, label="a")
>>> G.add_edge(1, 1, label="b")
>>> G.add_edge(2, 2, label="b")
>>> G.add_edge(3, 3, label="b")
>>> sd.is_follower_separated(G)
False