I've looked through CS SE and I've found a page that said you could find use BFS to find a MST if the edges are unweighted, but what if the edges are directed?
Given a directed graph between V vertices, I'm trying to find the minimum directed edges I need to add in order for every vertex to be connected to every other vertex.
Is MST the way to go? Or, is there another way I'm not thinking of.
I apologize if this question is too easy, as I am very new to programming. I appreciate any help. Thanks!