# DAGs

### From charlesreid1

# Notes

A directed acyclic graph is a directed graph that does not contain cycles.

For notes on detecting cycles, see Graphs/Cycles. (Use depth first search - see Graphs/DFS).

Examples of DAGs:

- All trees are DAGs (see Trees)
- All git repositories are DAGs

# Flags

TreesSeries on Data Structures Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree
Preorder traversal: Trees/Preorder Postorder traversal: Trees/Postorder In-Order traversal: Binary Trees/Inorder Breadth-First Search: BFS Breadth-First Traversal: BFT Depth-First Search: DFS Depth-First Traversal: DFT OOP Principles for Traversal: Tree Traversal/OOP Tree operations: Trees/Operations Performance
Finding Minimum in Log N Time: Tree/LogN Min Search
Abstract data type: Binary Trees/ADT Concrete implementations: Binary Trees/LinkedBinTree Binary Trees/Cheat Sheet
· Template:TreesFlagBase · e |