Before reading on, answer these:
Is the graph weighted or unweighted?
Do you need any path or the shortest path?
Which technique from your framework fits? Try to reason through it. Next unit reveals the pattern.
If you said BFS, you are on the right track. Connections have no weights, so every edge costs . BFS explores nodes layer by layer, guaranteeing that the first time you reach a node, you have found the shortest path to it. DFS would find a path, but not the shortest one.