(Network|Graph) - Directed acyclic graph (DAG)

About

A directed acyclic graph (DAG), is a finite directed graph with no directed cycles.

Unlike a tree data structure, a directed acyclic graph can have diamond-shaped edge/branch that rejoin.

For example, in a dependency graph:

• when a library A depends on the libraries B and C,
• and the libraries B and C depend together on D,

The dependency graph takes the form of a diamond .

Articles Related

Example

• flowcharts
• dependency graph

Viz

Mobile Patent Suits

Documentation / Reference

• wiki/Directed_acyclic_graph