Directed Acyclic Graph

say it: “dih-REK-tid ay-SY-klik GRAF” /dɪˈrɛktɪd eɪˈsaɪklɪk ɡræf/

A one-way graph with no cycles, so its vertices can always be put in an order where every edge points forward.

What is a directed acyclic graph (DAG)?

A directed acyclic graph, or DAG, is a graph whose edges go one way and never lead back to where they started ("acyclic" means "without a cycle"). Course prerequisites, build steps and a spreadsheet's formulas are DAGs when they make sense, and every DAG has a topological order.

Level: Freelancer · More Data Structures terms at this level

Updated

In other subjects