POJ 3249 - Test for Job
Problem : Find a path on DAG, such that the source has no in-degree and destination has no out-degree, and the sum of value on vertices maximum.
Solution : Do the topological-order DP.