A graph without cycles is called a/an:
acyclic graph
undirected graph
directed graph
simple graph
connected graph
complete graph
An acyclilc graph has no cycles.