DAG (Directed Acyclic Graph) Executor for task scheduling
Manages task dependencies and executes them in topological order
Uses Kahn’s algorithm for topological sorting with concurrent execution
Core trait defining task behavior and lifecycle
All tasks must implement this trait to be executable by the DAG
Provides hooks for custom pre/post processing logic