Talk:Rooted graph

rooted digraph: most common def?
I'm trying to decide, for the sake of presentation order, what is the most common def, i.e. if they're assumed connected from root (via directed path) or not. I think in compsci the latter is the case, but I recently found a couple of papers, mostly in the greedoid/matroid/antimatroid areas that don't define them as 1-connected (to the root.) Besides the one I've already added also does this. But it's by no means the rule in this field defines them as connected. JMP EAX (talk) 16:46, 25 July 2014 (UTC)