subgraph_isomorphism - running out of memory with relative large graphs
Would it be possible to implement a "yield" type (see coroutine library) implementation for "subgraph_isomorphism" to avoid high memory usage when (relative) large graphs are searched.