# DP on Graphs

## DP on Graphs

##### tip

Make sure you know the basics of graphs, DFS, topological sorting, SCC and DP before moving towards this section.

Read the sections 16.2, 16.3, 16.4, 18.1 and 18.3 from CPH book to understand DP on graphs, successor / functional graphs and binary lifting.

Go through the algorithm for finding LCA of two nodes in any tree using binary lifting and binary search from here

## Session slides

## Additional Resource

- If you want to learn more about DP on trees, through some problems, you can refer this CF blog