- graph-isomorphic? G1 G2 #!optional semantic-feasibility?procedure
- subgraph-isomorphic? G1 G2 #!optional semantic-feasibility?procedure
Predicate which tests if a graph G1 is isomorphic or subgraph-isomorphic to G2.
- G1
- the first graph
- G2
- the second graph
- semantic-feasibility?
- a procedure which evaluates semantic feasibility for a candidate pair. See discussion above.