code: public static <T,G extends Multigraph<T,? extends TypedEdge<T>>>
              TypedIsomorphicGraphCounter<T,G> asMotifs(Set<? extends G> motifs) {
          return new TypedIsomorphicGraphCounter<T,G>(motifs);
      }
docs: Creates a new {@code TypedIsomorphicGraphCounter} that counts only the specified
  motifs.  All other non-isomorphic graphs will not be counted.
  
  @param motifs the set of graph instance to be treats as valid motifs.
  Note that this input graph is not itself checked for isomorphism.
  The presence of isomorphic graphs in {@code motifs} will cause all
  of the counts to be accumulated on one of the variants, while the
  other will have a count of 0.