Graphs vs. Trees

• The term “tree” has a slightly different meaning for graphs than what we have covered in previous lectures.

• A graph is a tree if it contains no cycles and is connected.

• Such trees are called Spanning Trees. They are a tree that “spans” and connects all the nodes of the graph.

• Such a graph can be topologically sorted in a top-down hierarchy and arranged in a two dimensional plane similar to a k-ary tree.