- Software Engineer - mostly on GitLab
by linde9821
6
Computes tidy, aesthetic tree layouts using the Walker (Buchheim–Jünger–Leipert) algorithm in O(n) time. Adapter-based traversal, variable node sizes, multiple orientations, outputs deterministic node coordinates.
#web, #wasm, #utility, #performance-optimization, #native, #kotlin-native, #desktop, #compose-multiplatform, #compose