Longest-path

Longest Path in DAG — Graph DP with Memoisation

Find the longest path in a directed acyclic graph using DFS with memoisation. Since cycles are absent, DFS never revisits nodes, making top-down DP straightforward.