dugong
Dagre-compatible graph layout algorithms in Rust (port of dagrejs/dagre).
Implementation dependency: Mermaid applications should depend on
merman.dugongis published to support Merman's release dependency graph; its low-level graph and pipeline APIs are not a separately supported product surface.
merman-render uses this crate for diagram families that follow Dagre-style ranking, ordering, positioning, compound graph, and self-edge behavior. The port favors deterministic iteration and source-backed compatibility over a general graph-layout abstraction.
The current upstream baseline is @dagrejs/dagre v2.0.2, pinned to commit ba986662394f8f3ed608717194e5958f3386ce01. Repository maintainers track the authoritative checkout in tools/upstreams/REPOS.lock.json.
Benchmarks cover the complete layout pipeline and the network_simplex and feasible_tree ranker internals.
Licensed under either Apache-2.0 or MIT at your option. Dagre-derived material is recorded in THIRD_PARTY_NOTICES.md.