Answer
Algorithm to build a rooted spanning tree for connected directed graphs in which each vertex has the same
in-degree and out-degree.
Work Step by Step
--First construct an Euler circuit in the directed graph.
--Then delete from this circuit every edge that goes to a vertex previously visited.
