symbolic_dynamics.sofic.is_deterministic¶
-
symbolic_dynamics.sofic.
is_deterministic
(G)[source]¶ Returns True iff G is deterministic.
A labeled graph G is deterministic if every edge starting at a given vertex is labeled uniquely.
- Parameters
- Glabeled graph
Examples
>>> G = nx.MultiDiGraph() >>> G.add_edge(1, 2, label="a") >>> G.add_edge(1, 3, label="b") >>> sd.is_deterministic(G) True >>> G.add_edge(1, 4, label="a") >>> sd.is_deterministic(G) False