Get triad subgraphs

I note that python-igraph has the method Graph.triad_census, which returns the count of each triad type in a graph.
I haven’t been able to find a method in igraph which gives all the actual subgraphs (edges & vertices) of each triad type. If it does not exist, are there any plans for future inclusion of such a method?

At the moment we are using NetworkX’s ‘triads_by_type’ method, which gives quite satisfactory output, however we are looking for an increase in performance.

Thank you!

It is possible for the connected triads.

The motifs_randesu() function has a callback parameter. Here you can pass a function which will be called with each triad found, and its type (“isoclass”).

Thank you! Much appreciated.