A graph is converted to tree structures before constructing a RNN for each tree.
we construct a tree T = (V T , E T ) of depth d rooted at v t using a breadth-first search algorithm from G. V T and E T are the sets of vertices and edges in the tree.