Graph motifs are small connected induced subgraphs with a well-defined structure. These functions search a graph for various motifs.
count_motifs(graph, size = 3, cut.prob = rep(0, size))
Graph object, the input graph.
The size of the motif.
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.