Yes, It can be applied.
Because the fundamental property of topological sort states that no node can be traversed until its requisite node(s) has been traversed.
In BFS we can see that every next node is only traversed after all the nodes on its previous level are visited. Which essentially is the same thing as topological ordering. Although you do need to update some baselines in the program, but the essence of BFS is maintained.
