Some time ago I found an interesting PDF about graph layout algorithms in general [0]. Nothing groundbreaking, but it also covers approaches for orthogonal layo

Some time ago I found an interesting PDF about graph layout algorithms in general [0]. Nothing groundbreaking, but it also covers approaches for orthogonal layouts (aka only horizontal/vertical edge paths like in your fourth condition) and I liked how straightforward it is. To meet all these criteria would indeed be amazing. For 5) you may get semi-reliable results by doing the layout deterministically and optimize for things like short edge length, so adding new nodes would just push around the rest a little bit. But good luck avoiding crossings at the same time. [0] https://cs.brown.edu/people/rtamassi/papers/gd-tutorial/gd-constraints.pdf https://cs.brown.edu/people/rtamassi/papers/gd-tutorial/gd-c...