Module deps 

Structs

DependencyOrder

Result of dependency resolution

Functions

compute_reverse_stop_order

Compute the order in which daemons should be stopped, respecting reverse dependency order (dependents first, then their dependencies).

resolve_dependencies

Resolve dependency order using Kahn’s algorithm (topological sort).

reverse_stop_order

Group active_ids into levels to stop one after another: nothing in a level is needed by anything in a later one, directly or through daemons that are not being stopped. Each level can be stopped concurrently, and keeps the order of active_ids.