SmashThePath is a student-driven ALGOSUP project that harnesses C++ efficiency to deliver a high-performance REST API for ultra-fast shortest path computation on static bidirectional weighted graphs.
| Feature | Description |
|---|---|
| π High-Speed Search | Supports unidirectional and bidirectional A search* for optimal pathfinding. |
| β‘ ALT Heuristics | Uses landmark preprocessing for significantly faster queries. |
| π REST API | Queries shortest paths using HTTP GET requests, returning results in JSON/XML. |
| π Graph Validation | Performs integrity and connectivity checks before processing. |
| πΎ Efficient Memory Usage | Utilizes lazy buffer resets, multi-threading, and C++ STL optimizations for low RAM consumption. |
| π₯οΈ Cross-Platform | Compatible with Windows, Linux, and macOS. |
| π§ Configurable Heuristics | Supports adjustable weight factors to balance speed vs. accuracy in pathfinding. |
| π§΅ Multi-Threading | Bidirectional A search* runs in parallel for maximum efficiency. |
| π Smart Graph Optimizations | Dynamically selects best search strategy based on graph density. |
| π Memory-Efficient Graph Representation | Uses CSR (Compressed Sparse Row) storage for faster edge lookups. |
| π Persistent Preprocessing | Saves landmark data to reduce preprocessing time in future runs. |
| Task | Deadline |
|---|---|
| π Functional Specification | 01/20/2025 |
| βοΈ Technical Specification | 01/27/2025 |
| π₯οΈ Code Implementation | 01/31/2025 |
| π§ͺ Test Cases / Test Plan | 02/07/2025 |
| π User Manual | 02/07/2025 |
To utilize our API, refer to our User Manual π.
| π Document | π Link |
|---|---|
| π Functional Specifications | FunctionalSpecifications.md |
| βοΈ Technical Specifications | TechnicalSpecifications.md |
| π§ͺ Test Plan | TestPlan.md |
| β Test Cases | TestCases.md |
| π User Manual | UserManual.pdf |
| π Settlement Agreement | Settlement.md |
| π Project Charter | ProjectCharter.md |
| π Weekly Reports | Weekly Reports |
| π Post Mortem | PostMortem.md |