On Sunday, March 12, 2017 at 11:49:11 AM UTC, Peleg Michaeli wrote:
>
> I would like to iterate over *distinct* subgraphs (isomorphic to a graph
> H) of a given graph G. So, for example, the number of 3-cycles such an
> iterator will yield for the 3-cycle is 1 (and not 6, like
> `.subgraph_sea
Hi,
I would like to iterate over *distinct* subgraphs (isomorphic to a graph H)
of a given graph G. So, for example, the number of 3-cycles such an
iterator will yield for the 3-cycle is 1 (and not 6, like
`.subgraph_search_iterator` yields).
Clearly, for a given set of vertices I can check gra
