Minimum Test Workflow Time

Problem Statement

Minimum Test Workflow Time Problem Description In a CI/CD pipeline, system tests must run in a specific sequence. The components of the pipeline are organized in a tree-like dependency graph such that moving between directly connected components takes 1 unit of time. Implement a function that computes the minimum total time to perform a testing operation as follows: Starting at an initial component, represented by the integer, startComponent . Visiting a set of k key modules along the way specified by the integer array keyModules . Finally ending at the final component represented by the integer, endComponent . The function getTestWorkflowTime takes the following inputs: int dependencies_nodes : the number of components in the system int dependencies_from[dependencies_nodes - 1] : the source of each dependency int dependencies_to[dependencies_nodes - 1] : the destination of each dependency int startComponent : the component where testing begins int endComponent : the component where te