Circular dependencies

Alternative name for Cyclic dependencies.

Circular dependency is the familiar name for a structural dependency loop: architecture unit A depends on B, B depends on C, and C depends back on A. AtlasArc retains that loop as inspectable dependency evidence while reporting active warnings from a separate problem graph. Precise governance or a local Safe Haven can break the warning calculation without erasing the underlying relationships. Treat a circular dependency as an architectural signal to investigate, not proof that its members are inherently impossible to understand, test, extract, or deploy independently. The full Cyclic dependencies page explains cycle groups, classifications, governance, and suppression.

Screenshot: one circular dependency retained as structural evidence beside the active problem-cycle treatment of the same loop
A circular relationship remains inspectable even when governance or a local Safe Haven changes whether it sustains an active warning.