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 two directly connected components takes 1 unit of time. Implement a function that computes the minimum total time to perform a testing operation as follows: Start at an initial component, given by the integer startComponent . Visit a set of k key modules along the way, given by the integer array keyModules . Finally, end at the final component, given by the integer endComponent . The function getTestWorkflowTime takes the following inputs: int dependencies_nodes : the number of components in the system. Components are numbered 1 to dependencies_nodes . int dependencies_from[dependencies_nodes - 1] : one endpoint of each dependency. int dependencies_to[dependencies_nodes - 1] : the other endpoint of each dependency. int startComponent : the component where testing begins. in