hello
i have some graphs that look like this:


i think they look nice but they seem to be 'sticky' across subtelomeres
i would like to ask the algorithm to not make joins across tens of Mb
can you say if it might be more effective to use --max-edge-jump or --max-path-jump, and maybe suggest a parameter range for testing?
thank you very much