A graph with no cycles where all edges point in a single direction.

A graph containing at least one cycle where all nodes are reachable.

A graph with undirected edges and no cycles.

A disconnected graph with directed edges.