# askarakshabayev/ads2025fall architecture

> Architecture diagram of the GitHub repository askarakshabayev/ads2025fall, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-05). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/askarakshabayev/ads2025fall
- Repository: https://github.com/askarakshabayev/ads2025fall

## Overview

ADS2025FALL is a collection of standalone C++ exercises accompanying an algorithms and data structures course, not a single integrated application. The principal workflow is a learner running an exercise, supplying input through standard input, and observing an algorithmic result through standard output. The map groups the README’s lecture topics into data structures, searching and sorting, string algorithms, and graph algorithms. Source excerpts show several concrete command-line examples; links for unsampled exercises are documented topic coverage, not inspected call relationships.

Main entry points: [`week2/p1.cpp`](https://github.com/askarakshabayev/ads2025fall/blob/main/week2/p1.cpp) (Lists, Stacks, Queues), [`week5/p1.cpp`](https://github.com/askarakshabayev/ads2025fall/blob/main/week5/p1.cpp) (Heap Operations), [`week4/1.cpp`](https://github.com/askarakshabayev/ads2025fall/blob/main/week4/1.cpp) (Binary Search Trees), [`week3`](https://github.com/askarakshabayev/ads2025fall/tree/main/week3) (Binary Search)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_structures["Data Structures"]
  node_linear["Lists, Stacks, Queues<br/>[p1.cpp]"]
  node_heap["Heap Operations<br/>[p1.cpp]"]
  node_bst["Binary Search Trees<br/>[1.cpp]"]
end

subgraph group_search_sort["Search and Sorting"]
  node_binary_search["Binary Search"]
  node_quick_sort["Quick Sort"]
  node_merge_sort["Merge Sort<br/>[p7.cpp]"]
end

subgraph group_strings["String Algorithms"]
  node_hashing["Hashing"]
  node_rabin_karp["Rabin-Karp<br/>[5.cpp]"]
  node_prefix_kmp["Prefix Function, KMP"]
end

subgraph group_graphs["Graph Algorithms"]
  node_bfs["Breadth-First Search"]
  node_dfs["Depth-First Search<br/>[1_dfs_basic.cpp]"]
  node_components["Connected Components"]
  node_bipartite["Bipartite Testing<br/>[3_bipartite.cpp]"]
  node_topological["Topological Sort"]
  node_cycle_detection["Cycle Detection"]
  node_path_finding["Path Finding<br/>[6_find_path.cpp]"]
  node_islands["Island Counting"]
  node_spanning_trees["Kruskal and Prim"]
  node_shortest_paths["Shortest Paths<br/>[3.cpp]"]
end

node_learner(("Learner"))

node_learner -->|"runs exercise"| node_linear
node_learner -->|"runs exercise"| node_heap
node_learner -->|"runs exercise"| node_bst
node_learner -->|"runs exercise"| node_merge_sort
node_learner -->|"runs exercise"| node_rabin_karp
node_learner -->|"runs exercise"| node_dfs
node_learner -->|"runs exercise"| node_bfs
node_learner -->|"runs exercise"| node_shortest_paths
node_learner -.->|"runs exercise"| node_binary_search
node_learner -.->|"runs exercise"| node_quick_sort
node_learner -.->|"runs exercise"| node_hashing
node_learner -.->|"runs exercise"| node_prefix_kmp
node_learner -.->|"runs exercise"| node_components
node_learner -.->|"runs exercise"| node_bipartite
node_learner -.->|"runs exercise"| node_topological
node_learner -.->|"runs exercise"| node_cycle_detection
node_learner -.->|"runs exercise"| node_path_finding
node_learner -.->|"runs exercise"| node_islands
node_learner -.->|"runs exercise"| node_spanning_trees

click node_linear "https://github.com/askarakshabayev/ads2025fall/blob/main/week2/p1.cpp"
click node_heap "https://github.com/askarakshabayev/ads2025fall/blob/main/week5/p1.cpp"
click node_bst "https://github.com/askarakshabayev/ads2025fall/blob/main/week4/1.cpp"
click node_binary_search "https://github.com/askarakshabayev/ads2025fall/tree/main/week3"
click node_quick_sort "https://github.com/askarakshabayev/ads2025fall/tree/main/week6"
click node_merge_sort "https://github.com/askarakshabayev/ads2025fall/blob/main/week6/p7.cpp"
click node_hashing "https://github.com/askarakshabayev/ads2025fall/tree/main/week8"
click node_rabin_karp "https://github.com/askarakshabayev/ads2025fall/blob/main/week8/5.cpp"
click node_prefix_kmp "https://github.com/askarakshabayev/ads2025fall/tree/main/week9"
click node_bfs "https://github.com/askarakshabayev/ads2025fall/tree/main/week10"
click node_dfs "https://github.com/askarakshabayev/ads2025fall/blob/main/week11/1_dfs_basic.cpp"
click node_components "https://github.com/askarakshabayev/ads2025fall/blob/main/week11/2_count_components.cpp"
click node_bipartite "https://github.com/askarakshabayev/ads2025fall/blob/main/week11/3_bipartite.cpp"
click node_topological "https://github.com/askarakshabayev/ads2025fall/blob/main/week11/4_topological_sort.cpp"
click node_cycle_detection "https://github.com/askarakshabayev/ads2025fall/tree/main/week11"
click node_path_finding "https://github.com/askarakshabayev/ads2025fall/blob/main/week11/6_find_path.cpp"
click node_islands "https://github.com/askarakshabayev/ads2025fall/blob/main/week11/8_islands_count.cpp"
click node_spanning_trees "https://github.com/askarakshabayev/ads2025fall/tree/main/week12"
click node_shortest_paths "https://github.com/askarakshabayev/ads2025fall/blob/main/week12/3.cpp"

classDef toneNeutral fill:#f8fafc,stroke:#334155,stroke-width:1.5px,color:#0f172a
classDef toneBlue fill:#dbeafe,stroke:#2563eb,stroke-width:1.5px,color:#172554
classDef toneAmber fill:#fef3c7,stroke:#d97706,stroke-width:1.5px,color:#78350f
classDef toneMint fill:#dcfce7,stroke:#16a34a,stroke-width:1.5px,color:#14532d
classDef toneRose fill:#ffe4e6,stroke:#e11d48,stroke-width:1.5px,color:#881337
classDef toneIndigo fill:#e0e7ff,stroke:#4f46e5,stroke-width:1.5px,color:#312e81
classDef toneTeal fill:#ccfbf1,stroke:#0f766e,stroke-width:1.5px,color:#134e4a
class node_linear,node_heap,node_bst toneBlue
class node_binary_search,node_quick_sort,node_merge_sort toneAmber
class node_hashing,node_rabin_karp,node_prefix_kmp toneMint
class node_bfs,node_dfs,node_components,node_bipartite,node_topological,node_cycle_detection,node_path_finding,node_islands,node_spanning_trees,node_shortest_paths toneRose
class node_learner toneIndigo
```

## Components

### Data Structures

- [Lists, Stacks, Queues](https://github.com/askarakshabayev/ads2025fall/blob/main/week2/p1.cpp): `week2/p1.cpp`
- [Heap Operations](https://github.com/askarakshabayev/ads2025fall/blob/main/week5/p1.cpp): `week5/p1.cpp`
- [Binary Search Trees](https://github.com/askarakshabayev/ads2025fall/blob/main/week4/1.cpp): `week4/1.cpp`

### Search and Sorting

- [Binary Search](https://github.com/askarakshabayev/ads2025fall/tree/main/week3): `week3`
- [Quick Sort](https://github.com/askarakshabayev/ads2025fall/tree/main/week6): `week6`
- [Merge Sort](https://github.com/askarakshabayev/ads2025fall/blob/main/week6/p7.cpp): `week6/p7.cpp`

### String Algorithms

- [Hashing](https://github.com/askarakshabayev/ads2025fall/tree/main/week8): `week8`
- [Rabin-Karp](https://github.com/askarakshabayev/ads2025fall/blob/main/week8/5.cpp): `week8/5.cpp`
- [Prefix Function, KMP](https://github.com/askarakshabayev/ads2025fall/tree/main/week9): `week9`

### Graph Algorithms

- [Breadth-First Search](https://github.com/askarakshabayev/ads2025fall/tree/main/week10): `week10`
- [Depth-First Search](https://github.com/askarakshabayev/ads2025fall/blob/main/week11/1_dfs_basic.cpp): `week11/1_dfs_basic.cpp`
- [Connected Components](https://github.com/askarakshabayev/ads2025fall/blob/main/week11/2_count_components.cpp): `week11/2_count_components.cpp`
- [Bipartite Testing](https://github.com/askarakshabayev/ads2025fall/blob/main/week11/3_bipartite.cpp): `week11/3_bipartite.cpp`
- [Topological Sort](https://github.com/askarakshabayev/ads2025fall/blob/main/week11/4_topological_sort.cpp): `week11/4_topological_sort.cpp`
- [Cycle Detection](https://github.com/askarakshabayev/ads2025fall/tree/main/week11): `week11`
- [Path Finding](https://github.com/askarakshabayev/ads2025fall/blob/main/week11/6_find_path.cpp): `week11/6_find_path.cpp`
- [Island Counting](https://github.com/askarakshabayev/ads2025fall/blob/main/week11/8_islands_count.cpp): `week11/8_islands_count.cpp`
- [Kruskal and Prim](https://github.com/askarakshabayev/ads2025fall/tree/main/week12): `week12`
- [Shortest Paths](https://github.com/askarakshabayev/ads2025fall/blob/main/week12/3.cpp): `week12/3.cpp`

### Other components

- **Learner**

## Connections

- Learner → Lists, Stacks, Queues: runs exercise (evidence: `week2/p1.cpp`)
- Learner → Heap Operations: runs exercise (evidence: `week5/p1.cpp`)
- Learner → Binary Search Trees: runs exercise (evidence: `week4/1.cpp`)
- Learner → Merge Sort: runs exercise (evidence: `week6/p7.cpp`)
- Learner → Rabin-Karp: runs exercise (evidence: `week8/5.cpp`)
- Learner → Depth-First Search: runs exercise (evidence: `week11/1_dfs_basic.cpp`)
- Learner → Breadth-First Search: runs exercise (evidence: `week10/4.cpp`)
- Learner → Shortest Paths: runs exercise (evidence: `week12/3.cpp`)
- Learner → Binary Search: runs exercise
- Learner → Quick Sort: runs exercise
- Learner → Hashing: runs exercise
- Learner → Prefix Function, KMP: runs exercise
- Learner → Connected Components: runs exercise
- Learner → Bipartite Testing: runs exercise
- Learner → Topological Sort: runs exercise
- Learner → Cycle Detection: runs exercise
- Learner → Path Finding: runs exercise
- Learner → Island Counting: runs exercise
- Learner → Kruskal and Prim: runs exercise
