Comments on: Computer Algorithms: Longest Increasing Subsequence /2012/12/03/computer-algorithms-longest-increasing-subsequence/ on web development Fri, 26 Oct 2018 21:40:18 +0000 hourly 1 https://wordpress.org/?v=5.0.3 By: j_random_hacker /2012/12/03/computer-algorithms-longest-increasing-subsequence/comment-page-1/#comment-19264 Mon, 02 Sep 2013 12:15:31 +0000 /?p=3478#comment-19264 Hi,

Nice tutorial. One little point: in a directed graph, an edge from j to i is written (j, i), so I think in your final description of the algorithm, you have the edge around the wrong way. It should be:

2.1. S(i) := 1 + max(S(j), where (j, i) is an edge from the DAG);

Thanks!

]]>