SwiftEx Logistics Engine
Architected a high-performance, console-based logistics engine mapping a 40+ city network using custom graph structures, priority queues, and alternative backup routing algorithms with zero external STL dependencies.
40+ Cities
Transit Network
Fully interconnected weighted graph
< 1 µs
Lookup Latency
Zero-STL custom chained hash table
< 5 ms
Path Computation
Yen's K-Shortest Paths optimization
0
STL Dependencies
100% custom data structures & memory management
Operational Constraints & Friction
Industrial supply chain logistics require simulating large-scale parcel distribution across 40+ nodes with alternative backup routing under zero-STL and microsecond performance constraints.
Architectural Execution
Architected a high-performance, console-based logistics engine mapping a 40+ city network using custom graph structures, priority queues, and alternative backup routing algorithms with zero external STL dependencies.
SwiftEx Logistics Engine — System Architecture
High-Level Topology & Data Flow
CLI Terminal & Simulated Warehouse Sensors
Client requests, sensors & telemetry
Event Dispatcher & Command Interpreter
ACID Persistence & Read/Write separation
Internal Topology & Data Mechanics
The engine is structured around a memory-managed Adjacency List Graph with a custom Min-Heap Priority Queue. Route calculations execute Dijkstra's algorithm for primary pathfinding and Yen's K-Shortest Paths for fault-tolerant dynamic diversion upon road congestion.
Engineering Obstacles Overcome
Enforcing strict O(1) database lookups and high-frequency parcel prioritization without relying on standard STL containers or third-party memory managers.
- ✓Custom Min-Heap Priority Queues
- ✓Yen’s K-Shortest Path Optimization
- ✓Chained Hash Map Parcel Tracking
- ✓Dynamic Operations Undo Stack
- ✓Encrypted Identity Persistence
Project Delivery & Impact
Engineered a modular, zero-STL architecture tracking live warehouse throughput and scheduling complex transit routes with zero external dependencies.