PATH = {G, u, v, k G = (V, E) is a directed graph, u, v V, k 0 is an integer, and there exists a path from u to v in G whose length is at most k}

Note that the problem G, u, v, k is encoded as a binary string.