software engineering

In a project activities are given as arrows from vertices A, B, C, D , E and F in a directed graph and the weeks taken for each activity are given as integers along the arrows (Mealy method). We need to start the project from A and end in F.

Find the different paths from A to F and time taken in weeks for each path

(For example if you are asked to compute paths from A to B there is only one path AB and time in weeks is 4 weeks and from A to D there are two paths AD which is 5 weeks and AB BD which is 10 (4 + 6) weeks)

Identify the critical path among all the paths.

5 4 1 6/4 4 5 2 3