"hiho" is a weekly series of contest we developed to help programmers improve their skills following some architecture.

In the several following weeks we will learn some kinds of network flow problems. This week let's solve the problem of minimum path cover in DAG using max flow algorithm.