Data Structures
SMART CITY
No-STL C++ simulation of transport, medical, and housing infrastructure.
OVERVIEW
A comprehensive ecosystem simulating transport, medical, and housing infrastructure built entirely from scratch without the C++ STL. Every data structure — graphs, trees, queues, hash maps — was designed and implemented to spec.
KEY HIGHLIGHTS
- 01Dijkstra shortest-path routing over Adjacency List graphs for transport queries
- 02N-ary Trees for Sector→House administrative hierarchy; School/Family Trees for demographics
- 03Hashing with Separate Chaining for O(1) citizen record retrieval
TECHNICAL IMPLEMENTATION
Spatial & Network Mapping
Engineered a high-performance routing network using Adjacency List Graphs and implemented Dijkstra’s Algorithm to compute shortest-path transport queries across the simulated city grid. Route queries ran in O((V + E) log V) time using a custom min-heap priority queue.
Hierarchical Data Management
Designed complex, multi-tiered architectures including N-ary Trees for administrative hierarchies (Sector-to-House) and specialized School/Family Trees to track demographic relationships across city units.
High-Efficiency Memory Retrieval
Built a robust indexing system utilizing Hashing with Separate Chaining for near O(1) retrieval of citizen records, alongside Priority Queues and Circular Queues for dynamic task scheduling across medical and emergency response systems.
TECH STACK