SemVer Dependency Resolver (2D)

Three consumer packages each declare a semantic-version range against a shared library D. This simulator runs the same range-matching algorithm real package managers use — caret, tilde and exact ranges compared against SemVer precedence over a small published registry — to find, for each consumer, the highest version that satisfies its requirement. When all three agree, the dependency graph dedupes to one shared install; when they disagree, it either reports a conflict or falls back to nested per-consumer copies, exactly as npm/yarn resolution trees do in a real mobile build. This 2D sibling renders the identical resolution logic as a flat, pannable/zoomable node graph instead of an orbiting 3D scene.