OQGraph Max Graph Traversal Depth (where seq < N)

Do there is interest if I add the ability to limit the depth of the traversal ?

My use case is of a dataset of about 2M nodes and 7M edge, and what I want to explore the relationship until a depth of 5 at most.

But a sql like

SELECT * FROM oq_graph WHERE latch='breadth_first' AND origid=2;

Can easily take 18second plus on a Xeon Silver 4000 something @2.8Ghz, as is not possible to say "stop!" and he will happily traverse all the nodes.

Will such feature can be considered to inclusion ? The sql could become something like

SELECT * FROM oq_graph WHERE latch='breadth_first' AND origid=2 AND seq < N;

For the record the sintax

SELECT * FROM oq_graph WHERE latch='breadth_first' AND origid=2 AND `weight` = '1';

Is accepted but ignored during the processing, it will be applied only when showing the data.