What? A graph that doesn’t have any cycles. (DAG) Examples: Pre-requisite courses in University. Note: Every DAG has at least once source node. DAG implies Topological Ordering
