- graph-isomorphisms-list G1 G2 #!optional semantic-feasibility?procedure
- subgraph-isomorphisms-list G1 G2 #!optional semantic-feasibility?procedure
Same as above, however returns a list instead of a lazy-seq. I suggest avoiding these, as there may be many isomorphisms between two large graphs. As a result, the runtime of this is not necessarily known.