[ad_1]
Yes, the BFS algorithm works for every graph with unweighted edges.
Thus it can be used for a graph with directed edges as well as long as it does not contain any weights.
[ad_2]
solved Can BFS be used to find single source shortest path in an unweighted directed graph? [closed]