Autosplit feature

[moodymudskipper]

Cut diagrams into n pieces. We could give either a vector to cutpoints arg OR a scalar, and in that case we'll attempt to cut into almost equal parts in term of height ~n. Algo TBD but we d overlap on 1st / last step, cut only on nodes that are alone in their row, and recommend a number that looks nice.

Easy Algo :

• max height is n, cut at last possibility with single block row (meaning no other block nor parallel path) , and start over from there
• check if we have same amount of diagrams for n-1, if yes it's our new split, check n-2 and so on. This is to avoid unbalanced splits with only last step on last diagram etc.

This won't work for all functions, need to design behavior for long parallel paths.

[github-actions[bot]]

This old thread has been automatically locked. If you think you have found something related to this, please open a new issue and link to this old issue if necessary.