If all edges are unweighted AND DIRECTED, can one use BFS to obtain a MST?
This is known as an arborescence.  There are algorithms for this problem, such as the Chu-Liu/Edmonds algorithm, but they are more complex than just doing a BFS.  See also https://stackoverflow.com/q/21991823/781723.