A cyclic undirected graph i.e. there exists at most one path between each each pair of vertices. # Properties Strongly connected components will be trees.