Answer TRUE or FALSE.

A DAG is a directed graph without cycles.

True
  • True
  • False

A DAG is a Directed Acyclic Graph.

An acyclic graph has no cycles.