Compath subproblem is solved by a dynamic programming algorithm derived from finding a shortest path in an acyclic graph.

• 子问题的求解用到了多情景下的寻找最短路方法；