pub const K_MAX_HOPS_CEILING: u32 = 64;Expand description
Inclusive upper bound for --max-hops and --depth on graph traversal.
The breadth-first walks carry visited sets, so a huge value terminates at the graph diameter rather than running away. The bound is here to keep the surface honest, and because a request for more than sixty-four hops is a typo in every real corpus.