TALA自动布局算法正式开源

Terrastruct公司宣布其TALA自动布局算法已正式开源，采用MPL-2.0许可证1。该算法是一款专为软件架构图设计的正交布局引擎，相比传统DAG布局算法更接近白板效果，融合了多篇图论研究论文的思想和原创技术1。

TALA已集成到D2 v0.9.0版本中1。用户安装后可通过指定--layout=tala参数使用该算法，或直接访问play.d2lang.com进行体验1。该算法具有随机性，默认使用3个种子以选择最佳布局结果1。同时支持自定义节点位置和混合位置指定等功能1。

相比Dagre和ELK等竞品，TALA在DAG图表现较弱，大型图表的运行时间呈现非线性增长1。该项目由Gavin Nishizawa和Júlio César Batista主要贡献完成1。

Terrastruct has released TALA, its automatic layout algorithm for software architecture diagrams, under the open-source MPL-2.0 license, the same license used for D2.1 The orthogonal layout engine is designed to produce results closer to whiteboard-style diagrams compared to traditional DAG layout algorithms, and incorporates concepts from multiple graph theory research papers alongside proprietary techniques.1

The algorithm has been integrated into D2 v0.9.0 and can be used by specifying the --layout=tala parameter during installation or through the online interface at play.d2lang.com.1 TALA employs randomization in its layout process, defaulting to three seed variations to select the best resulting layout.1 The tool supports custom node positioning and hybrid position specification, allowing users to fix certain elements while letting others be automatically arranged.1

While TALA performs well on software architecture diagrams, it shows weaker performance compared to Dagre and ELK algorithms on general DAG graphs, and exhibits non-linear runtime growth on large-scale diagrams.1 The development was led by contributors Gavin Nishizawa and Júlio César Batista.1