Directed graph¶
- Definitions
- Tournament
- Directed Acyclic Graph (DAG)
- Strongly Connected Components
- Basic Concepts
- Definition 3.4.1 (Strongly Connected Vertex Pair)
- Definition 3.4.2 (Strongly Connected Graph)
- Definition 3.4.3 (Strongly Connected Component (SCC))
- Lemma 3.4.4
- Result 3.4.5
- Definition 3.4.6 (Inverse Graph)
- Definition 3.4.7 (Condensed Graph of Strongly Connected Components)
- Theorem 3.4.8
- Result 3.4.9
- Finding Strongly Connected Components
- Basic Concepts
- Detecting Cycles in Directed Graphs
- Games and Directed Graphs
- Functional Graphs and Permutation Graphs
This book is made by The Shaazzz contributors.
It is publicly available with cc-by-sa license.
Last updated at آوریل 19, 2025.
Rendered by Sphinx (4.3.2) and Minoo theme (Beta 0.9.7).
