symbolic_dynamics.sofic.is_fully_deterministic

symbolic_dynamics.sofic.is_fully_deterministic(G)[source]

Returns True iff G is fully deterministic.

A labeled graph G is fully deterministic if G is deterministic and for every vertex q in G, the set of labels of edges starting at q is equal the set of labels appearing in G.

Parameters
Glabeled graph

See also

is_deterministic(), alphabet()

Examples

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