The tree layout method recursively lays out the graph as a tree starting at the first vertex, or the specified root at the top.

This layout method works only in two dimensions.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$G≔\mathrm{RandomGraphs}:-\mathrm{RandomTree}\left(25\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; unweighted\; graph\; with\; 25\; vertices\; and\; 24\; edge(s)}$

$\mathrm{DrawGraph}\left(G\,\mathrm{layout}=\mathrm{tree}\right)$