networkx 2.8.2 Pypi GitHub Homepage
Other Docs
syntactic_feasibility(self, G1_node, G2_node)

This function returns True if it is adding the candidate pair to the current partial isomorphism/monomorphism mapping is allowable. The addition is allowable if the inclusion of the candidate pair does not make it impossible for an isomorphism/monomorphism to be found.

Returns True if adding (G1_node, G2_node) is syntactically feasible.

Examples

See :

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them


GitHub : /networkx/algorithms/isomorphism/isomorphvf2.py#622
type: <class 'function'>
Commit: