MINIMUM PATH COVER IN DAG

1

Is MPC IN DAG done with the help of ford fulkerson algorithm where capacity of each edge is considered as 1?

CAN ANYONE GIVE EASY REAL LIFE EXAMPLE FOR THIS? ?

Is this true that for disjoint edge we don’t have to find transitive closure??

2
3

Yes ithink it is possible

4

CAN YOU PROVIDE ME CODE FOR THIS

5

Here is the link to my code:-CodeChef: Practical coding for everyone
I have tried to check my code on various output but everytime my output is correct but still my code is not accepted.
Can you give me an input where my code is giving wrong output?Any help will be appreciated.