In Maze which have N keys what should i do to find shortest path with BFS?

Question

Now, I\'m trying to implement finding shortest path program with Python In my case, Maze has N keys and i should find all keys to escape from Maze

Example) start Point S,