`graph-isomorphisms``G1``G2``#!optional``semantic-feasibility?`procedure`subgraph-isomorphisms``G1``G2``#!optional``semantic-feasibility?`procedureReturns a lazy-seq of all match sets between G1 and G2. Each isomorphism in the lazy-seq is represented as a set of pairs which lists the match between G1 and G2. If subgraph-isomorphisms is used instead, the algorithm attempts to find a subgraph in G1 that is 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.