hsiegeln 4af71aabac fix: use graph root + edge walk to separate main flow from handlers ...

Root cause: graph.getNodes() is a flat list with duplicates — handler
compound children appear both nested inside their parent AND as
top-level entries. The previous separation tried to filter the flat
list but missed the duplicates, leaving handler children in rootNode.

New approach: walk from graph.getRoot() following non-ERROR edges to
discover main flow nodes. Edges targeting handler compounds (ON_EXCEPTION,
ON_COMPLETION) are not followed. This cleanly separates main flow from
handler sections using the graph's own structure.

Falls back to flat list filtering (old behavior) when graph.getRoot()
is null (legacy/test graphs).

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

2026-03-27 22:39:04 +01:00

..

src

fix: use graph root + edge walk to separate main flow from handlers

2026-03-27 22:39:04 +01:00

pom.xml

chore: update docs and config for PostgreSQL/OpenSearch storage layer

2026-03-17 00:26:50 +01:00