Graph motifs are small connected induced subgraphs with a well-defined structure. These functions search a graph for various motifs.
Graph object, the input graph.
The size of the motif, currently size 3 and 4 are supported in directed graphs and sizes 3-6 in undirected graphs.
Numeric vector giving the probabilities that the search graph is cut at a certain level. Its length should be the same as the size of the motif (the
sizeargument). By default no cuts are made.
The number of vertices to use as a starting point for finding motifs. Only used if the
NULLthen it specifies the vertices to use as a starting point for finding motifs.
sample_motifs() estimates the total number of motifs of a given
size in a graph based on a sample.