Graph theory for olympiad in informatics¶
Please read How to read this book before start reading.
- Basic definitions
- Trees
- Basic Properties
- Distance in Trees and Graphs
- Counting the Number of Trees
- DFS
- BFS
- گراف و نمایش ماتریسی آن
- Directed Graphs
- Undirected Graphs
- Adjacency Matrix
- Adjacency List
- Edge List
- Graph Representation
- نمایش گراف
- Depth-First Search (DFS)
- الگوریتم جستجوی اول عمق (DFS)
- Directed Graphs
- الگوریتم جستجوی عمق اول (DFS)
- Bipartite Graphs
- Spanning Trees
- Trees
- الگوریتم جستجوی اول سطح (BFS)
- ماتریس مجاورت
- لیست مجاورت
- لیست یالها
- الگوریتم جستجوی اول سطح
- BFS و DFS در یک گراف
- تعاریف گراف
- Representing a Graph Using an Edge List
- گرافهای جهتدار
- Introduction
- Graph Representation
- Graph Traversal
- Important Algorithms
- Algorithm for Finding the Diameter of a Tree
- Checking Ancestor-Descendant Relationship in Linear Time
- Finding the k-th Ancestor
- Bi-connecting with Minimum Number of Paths
- Vertex and Edge Cut Algorithms
- Idea Cultivation Workshop
- Directed graph
- Proof technics in graph problems
- Euler circuit and hamiltonian cycle
- Shortest path algorithms
- Matrix
- Tree data structures
- NP and NP-complete problems
- LCA
- Advanced tree algorithms
- Connectivity
- Matching
- Extra topics
- Appendix
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).
