elasticai.creator.graph.vf2.state
#
Module Contents#
Classes#
Data#
API#
- elasticai.creator.graph.vf2.state.T#
‘TypeVar(…)’
- elasticai.creator.graph.vf2.state.TP#
‘TypeVar(…)’
- class elasticai.creator.graph.vf2.state.State(graph: elasticai.creator.graph.graph.Graph[elasticai.creator.graph.vf2.state.T])[source]#
Bases:
typing.Generic
[elasticai.creator.graph.vf2.state.T
,elasticai.creator.graph.vf2.state.TP
]- remove_pair(a: elasticai.creator.graph.vf2.state.T, b: elasticai.creator.graph.vf2.state.TP) None [source]#
- contains_pair(a: elasticai.creator.graph.vf2.state.T, b: elasticai.creator.graph.vf2.state.TP) bool [source]#
- partial_predecessors(n: elasticai.creator.graph.vf2.state.T) set[elasticai.creator.graph.vf2.state.T] [source]#
- partial_successors(n: elasticai.creator.graph.vf2.state.T) set[elasticai.creator.graph.vf2.state.T] [source]#
- in_node_successors(n: elasticai.creator.graph.vf2.state.T) set[elasticai.creator.graph.vf2.state.T] [source]#
- in_node_predecessors(n: elasticai.creator.graph.vf2.state.T) set[elasticai.creator.graph.vf2.state.T] [source]#
- out_node_successors(n: elasticai.creator.graph.vf2.state.T) set[elasticai.creator.graph.vf2.state.T] [source]#
- out_node_predecessors(n: elasticai.creator.graph.vf2.state.T) set[elasticai.creator.graph.vf2.state.T] [source]#
- unseen_successors(n: elasticai.creator.graph.vf2.state.T) set[elasticai.creator.graph.vf2.state.T] [source]#
- unseen_predecessors(n: elasticai.creator.graph.vf2.state.T) set[elasticai.creator.graph.vf2.state.T] [source]#
- iter_matched_pairs() collections.abc.Iterator[tuple[elasticai.creator.graph.vf2.state.T, elasticai.creator.graph.vf2.state.TP]] [source]#
- add_pair(a: elasticai.creator.graph.vf2.state.T, b: elasticai.creator.graph.vf2.state.TP) None [source]#
- restore() None [source]#
reset all changes introduced in the current depth.
This is responsible for backtracking.
- update_in_nodes() None [source]#
Find out which nodes inside of current match are reachable from outside of current match.