Image Gallery: Directed acyclic graph

Back to article

Example of a directed acyclic graph
Montage 1, Image 1: A DAG
Montage 1, Image 2: A DAG
A Hasse diagram representing the partial order of set inclusion (⊆) among the subsets of a three-element set
Montage 2, Image 1: A topological ordering of a directed acyclic graph: every edge goes from earlier in the ordering (upper left) to later in the ordering (lower right). A directed graph is acyclic if and only if it has a topological ordering.
Montage 2, Image 2: A topological ordering of a directed acyclic graph: every edge goes from earlier in the ordering (upper left) to later in the ordering (lower right). A directed graph is acyclic if and only if it has a topological ordering.
Montage 3, Image 1: A multitree, a DAG in which the subgraph reachable from any vertex induces an undirected tree (e.g. in red)
Montage 3, Image 2: A multitree, a DAG in which the subgraph reachable from any vertex induces an undirected tree (e.g. in red)
The yellow directed acyclic graph is the condensation of the blue directed graph. It is formed by contracting each strongly connected component of the blue graph into a single yellow vertex.
PERT chart for a project with five milestones (labeled 10–50) and six tasks (labeled A–F). There are two critical paths, ADF and BC.
Family tree of the Ptolemaic dynasty, with many marriages between close relatives causing pedigree collapse.

--

Gemipedia Home
Go to Article
Using English Wikipedia. Change Language?

--
Size: 3.32 KB. 97.87% smaller than original: 155.98 KB 🤮
Fetched: 18 ms. Converted: 449 ms. 🐇

Made with 📚 and ❤️ by Acidus (mailto://)

All Wikipedia content is licensed under CC BY-SA 3.0