You learned what graphs are, how to represent them, and how to work with vertex degrees. The adjacency list beats the adjacency matrix for sparse graphs.
You solved problems by translating relationships into graph structure. Finding the town judge became a degree-counting problem. Detecting star graphs used edge properties.
Next up: graph traversal algorithms. You will learn how to visit every vertex and explore the graph structure systematically.