Status: IN
All edges are processed via `union` before the single `find(source) == find(destination)` query — the algorithm does not short-circuit if source and destination merge mid-loop.
Source: entries/2026/06/06/find-if-path-exists-in-graph-solution.md