Skip to content

A ride-sharing system simulation with real-time graph visualization, C++ based DSA algorithms, and a Node.js + Express backend.

Notifications You must be signed in to change notification settings

letDiyaCode/Uber-Mini

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

32 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Uber Mini Ride Sharing System

A complete ride-sharing matching system demonstrating advanced Data Structures and Algorithms concepts with a C++ backend and web-based frontend.


🎯 Features

  • 50-node city graph with realistic names
  • 12 drivers (Rajesh, Priya, Amit, Sneha, etc.)
  • 5 road types (Highway, Arterial, Local, Ring, Shortcut)
  • Real-time route calculation using Dijkstra
  • Algorithm visualization with logs

🛠️ Build Requirements

  • Node.js (recommended v18)
  • Python 3.x (for node-gyp)
  • C++ Compiler:
    • Windows: Visual Studio 2022 with C++ tools
    • Linux: GCC/build-essential
    • Mac: Xcode Command Line Tools

🚀 Quick Start

git clone "https://github.com/letDiyaCode/Uber-Mini"      # Clone the Repo
npm install                                               # Builds C++ backend automatically
npm start                                                 # Starts server on port 3000

Visit: http://localhost:3000


📊 Technology Stack

  • Backend: C++17, Node.js N-API
  • Server: Express.js (HTTP wrapper)
  • Frontend: HTML/CSS/JavaScript
  • Build: node-gyp

🎓 Learning Outcomes

  • C++ native addon development
  • Graph algorithms (Dijkstra)
  • Priority queues (Min-Heap)
  • HashMap implementations
  • Greedy algorithms
  • System design patterns

About

A ride-sharing system simulation with real-time graph visualization, C++ based DSA algorithms, and a Node.js + Express backend.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •