**Graph Representation and Search** *Nov 10* # Graph Representation and Search We'll discuss two methods (of several) for representing a graph: an adjacency list and an adjacency matrix. ## Adjacency List and BFS and DFS In the image below, you will find an example of the adjacency list representation as well as examples of a depth-first search and a breadth-first search. ![](images/2020-11-11-AdjacencyListAndSearch.jpg) ## Adjacency List DFS Walk-Through [Code for adjacency lists.](https://github.com/pomonacs622020fa/LectureCode/blob/master/Graphs/AdjacencyList.java)
# Adjacency Matrix Video Walk-Through [Code for adjacency matrices.](https://github.com/pomonacs622020fa/LectureCode/blob/master/Graphs/AdjacencyMatrix.java) ![](images/2020-11-11-AdjacencyMatrix.jpg)