Show that a subgraph T = (V, F) of the graph G = (V, E) is an arborescence of G rooted at r if and only if T contains r, T has no simple circuits, and for every vertex v ∈ V other than r, deg − (v) = 1 in T.