Implement the edge-uncrossing portion of the layout algorithm in a faster language (Rust?) that can be compiled to WASM.

2025-06-26T18:14:07Z

https://github.com/erikbrinkman/d3-dag

Implement the edge-uncrossing portion of the layout algorithm in a faster language (Rust?) that can be compiled to WASM.

Sense Atlas Front End

The edge-uncrossing algorithm in d3-dag (and Sugiyama in general) is known to run superlinearly (how bad?) to the edges it has to uncross.