graph-grammar@1.1.0

Minor Changes

• 63f6597: Embedding: a deleted node may now carry multiple embedding rules, selected per dangling edge by edgeLabelFilter and a new directionFilter ('incoming' | 'outgoing'). This lets one node route its boundary edges to different RHS targets by label and orientation (e.g. reconnecting a chain's incoming vs. outgoing edges to the correct endpoints). Fully backward compatible: a single embedding rule behaves exactly as before.

Patch Changes

• 63f6597: Priority strategy now weighs equal-priority PEERS instead of letting array order decide.

  The priority strategy still exhausts a higher-priority tier before considering any lower one, but
  within a tier of equal-priority rules it now draws WEIGHT-biased (reproducibly, via the seeded rng) —
  exactly as the random strategy does, confined to one tier. Previously the first rule listed at a given
  priority won every step it matched, so an always-matching peer (e.g. a dungeon's hollow-out) would
  starve its equals (fork) forever, collapsing a grammar that should branch into one linear chain.