I have a weighted DAG. I know how to compute the longest path from some source vertex $v$ in linear time as explained on this Wiki page.Now let $L$ be a positive integer. I want to find the longest possible path in the DAG whose length is at most $L$. Is there any efficient algorithm for this problem? I am new to this topic, so any idea or help is appreciated.
Longest path in a DAG with length limit
algorithms;shortest path;dag