A Graph that is a Tree

• By removing enough edges to eliminate cycles yet leave the graph connected we can turn the previous graph into a spanning tree…

• An example of the tree-like “hierarchy” is…