Adjacency Map
If an adjacency map, each vertice in the graph is mapped to a list of every incident edge. Similar to the Edge List, it uses $O(n+m)$ space.
Search
If an adjacency map, each vertice in the graph is mapped to a list of every incident edge. Similar to the Edge List, it uses $O(n+m)$ space.