# Directed Acyclic Graph (DAG) A type of graph without cycles. Here's an example: ```mermaid graph TD; A --> B; B --> C; B --> D; D --> E; ```