On page two of this discussion of spanning trees there are two different tree structures shown, one labeled DFS tree starting from a as the root and the other labeled Spanning tree created by DFS. If I were to write this out on paper my spanning tree would have looked more like the former than the latter.Are these distinguished here for convenience, one to show the tree structure of the algorithm vs one showing how the spanning tree fits within the original graph layout? Is this a standard convention, to show the spanning tree in the same layout as the original graph? Would it be wrong to diagram the spanning tree using the first layout?
Spanning tree display conventions
algorithms;discrete mathematics;spanning trees
Yes, the right one is shown for convenience. Whether is is a standard convention I do not know and I think it is not so important as both trees are the same, the right one is just formatted neatly so that it matches the structure of the original graph.It is not wrong to use the first layout (as shown on the left). However, readers might prefer the right one. 