title: How is Longest Increasing Sub-sequence a special case of longest path in DAG?
body: <p>I read this statement in "Hitchhiker's guide to algorithms". But, I'm not able to visualize it as in a LIS problem all we have is a sequence of numbers. How can I modulate it as a graph problem?</p>