# Silver - Graphs

*Flood Fill* refers to finding the number of connected components in a graph, frequently on a grid.

See Ch 10 of https://www.overleaf.com/project/5e73f65cde1d010001224d8a


- Depth First Search (DFS)

 - Graphs
   - [CSAcademy Lessons](https://csacademy.com/lessons/)
   - CPH 11, 12
   - Terminology
     - ex. bipartite graphs??