The "eager" dependency graph containing only non-deferrable edges. Useful for cycle detection and critical path analysis where deferred dependencies (Provider, Lazy) don't contribute.
The full dependency graph with all edges.
The root node key (the main dependency graph node).
All binding keys in this graph.
Number of bindings in this graph.
Find leaf bindings - bindings with no dependencies. These are typically bound instances, object classes, or external dependencies.
Find root bindings (entry points) - bindings with no dependents. These are typically graph accessors or exposed bindings.
Get all bindings in this graph.
Get binding metadata by key, or null if not found.