algorithm-implementations

2022

C++CMakeGraph AlgorithmsData Structures

── case study ────────────────────────────────────────────────────────────

What it is

Three standalone C++ programs for ASU's CSE310 data structures course, each built with no external libraries beyond the STL:

Red-black tree — a self-balancing BST with insert/delete/rotation, managing car-inventory records via a command-driven CLI (694-line implementation, 204-line driver).
Dijkstra's — shortest-path over a weighted city graph using a hand-rolled binary min-heap with decreaseKey, not std::priority_queue.
Kruskal's — MST construction using a disjoint-set/union-find with path compression and union-by-rank over graph edges.