Put it this way:
If I have a computation graph g, and a pattern search_fn represented by another computation graph s, does inductor promise to find all matching graph (up to isomorphism) s in g?
If the answer is yes, are there any constraints on the structure of s, either by limiting the number of nodes or limiting the number of edges?
If the answer is no, are there any suggestions for writing search_fn so that inductor works better?