Tracking dependency resolution graphs for optimization.

Deep dependency trees (e.g., A needs B needs C needs D) create significant object graph allocations and initialization latency.

Profiling DI involves visualizing the resolution graph. Tools exist to validate that graphs are shallow and don't contain unnecessary branches. If a tree goes 10 layers deep, it's often a sign of poor architectural boundaries. Flattening the hierarchy via domain events or messaging reduces the DI resolution overhead.