Type of graphs: undirected, directed (indegree, outdegree) Degree: number of edges incident to it. Spanning tree: a subgraph that contains all of that graph’s vertices and is a single tree; spaning forest: union of spanning trees of its connected components. Properties of a tree: V-1 number of edges, acyclic, connected; …