Can dynamic programming problems always be represented as DAG
<p>I am trying to draw a DAG for Longest Increasing Subsequence {3,2,6,4,5,1} but cannot break this into a DAG structure.</p>

<p>Is it possible to represent this in a tree like structure? </p>