ssn2025/data-structure-and-algorithms

This repository is a collection of algorithm examples, not a single application: its README is empty, and the files cover independent algorithms rather than a shared user-to-result workflow. The main areas are graph algorithms, divide-and-conquer, and greedy methods. Sampled source shows standalone examples and implementations, but no common entry point or cross-module calls; the graph therefore groups the algorithms without implying a runtime pipeline. Several graph algorithms are represented by notebooks whose contents were not sampled.