We count instantiations of COMPLETE for an upper bound on complexity (McAllester, 2002), using similar logic to (Chiang et al., 2013).
given a graph g, a path in g from a node v to a node v is a sequence The length of this path is k. A path is terminal if every edge in the path has a terminal label.