seesaw-tgg 1.0.0-rc1 — Initial public release

seesaw-tgg — delta-extended Triple Graph Grammar engine with
rank-based backtracking. First public release.

What's in this release

A working Rust implementation of the seesaw control mechanism for
Triple Graph Grammars: strictly monotonic change handling with rank
ordered rule application and backtracking on limit-touching matches.
Source graph L, target graph R, and correspondence graph D
are maintained as an observable triple; deltas unfold on ghost
projections until convergence, then re-integrate bottom-up to a new
stable triple.

Crate

Published to crates.io: https://crates.io/crates/seesaw-tgg/1.0.0-rc1

[dependencies]
seesaw-tgg = "1.0.0-rc1"

Docs: https://docs.rs/seesaw-tgg/1.0.0-rc1

Modules

• engine — cascade_step, run_cascade with rank-ordered backtracking
• graph — TypedGraph with Solid/Ghost/Tombstone status tracking
• ops — AddNode, AddEdge, DelNode, DelEdge, SetAttr with
  applicability semantics matching the paper definitions
• rule — RuleSetSpec, compile, instantiate. JSON-based rule format.
  Embedded R_Class/R_Attr/R_Getter/R_Setter demo rules for
  UML-Class → Java-Class bidirectional mapping.
• fold — consolidate, diff for baseline transitions
• xmi — Reader for EMF-style XMI 2.0 models

Quick start

cargo run --example basic_cascade

Output: source graph (4 nodes, 3 edges) → after R_Class+R_Attr cascade
(8 nodes, 9 edges) with CorrClass, JavaClass, CorrAttr, JavaField
correctly derived as Ghost-status nodes.

Status — release candidate

1.0.0-rc1. Core algorithms (cascade, fold, ranked backtracking) are
stable and test-covered across ~265 unit/integration/property tests
plus benchmark suites against published research cases (FASE 2019,
JOT 2022, LMCS 2024, STTT 2021, TTC 2015). API may still see breaking
changes before 1.0.0.

License

Apache License 2.0 — see LICENSE and NOTICE.