Skip to content

πŸš€ SmashThePath – Ultra-fast graph search API with optimized bidirectional / unidirectional pathfinding and heuristic acceleration for large-scale networks.

License

Notifications You must be signed in to change notification settings

algosup/2024-2025-project-3-quickest-path-team-1

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

πŸš€ SmashThePath "Blazing Fast Routes, Zero Detours!"

πŸ‘₯ Team Members

πŸ“Έ Photo 🏷️ Name 🎯 Role πŸ”— GitHub πŸ”— LinkedIn
Alexis SANTOS Project Manager GitHub LinkedIn
LoΓ―c NOGUES Program Manager GitHub LinkedIn
GrΓ©gory PAGNOUX Technical Leader GitHub LinkedIn
Yann-MaΓ«l BOUTON Software Engineer GitHub LinkedIn
Lucas MEGNAN Quality Assurance GitHub LinkedIn
Lena DE GERMAIN Technical Writer GitHub LinkedIn

πŸ“Œ Overview

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.


⚑ Key Features

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.

πŸ“… Deadlines

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

πŸ“– How to Use

To utilize our API, refer to our User Manual πŸ“š.


πŸ“‚ Project Documents

πŸ“ 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

About

πŸš€ SmashThePath – Ultra-fast graph search API with optimized bidirectional / unidirectional pathfinding and heuristic acceleration for large-scale networks.

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages