You need to understand graph representations: adjacency list (mapping each node to its neighbors, more space-efficient) and adjacency matrix (2D array for edge lookup). BFS explores nodes level by level using a queue data structure.
Complete Trees first if you haven't worked with trees. Trees are a special case of graphs (connected with no cycles), and tree level-order traversal is BFS. This builds needed intuition for graph BFS.