Skip to content

Java simulation of a delivery app using a custom generic min-heap. Built as part of a university Data Structures course.

Notifications You must be signed in to change notification settings

ohadswissa/molt-delivery-simulator

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

2 Commits
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Molt Delivery Simulator – Data Structures Project

This project simulates a basic delivery platform (like Wolt) using custom data structures.
Developed as part of the Data Structures course at Reichman University (2024).

πŸ›  Core Features

  • Min-Heap (Generic): Custom implementation of a type-safe binary min-heap with:

    • Insert, deleteMin, findMin
    • Merge in linear time
    • Capacity handling and resizing
  • MoltOrder & MoltDriver:

    • Both implement Comparable
    • Simulate real-world prioritization and driver scheduling logic

πŸ“š Key Concepts

  • Java Generics & Interfaces
  • Priority queues & Comparable pattern
  • Object-oriented simulation logic

πŸ§ͺ Technologies

  • Java 11
  • No external libraries
  • Structure supports testing with JUnit

πŸ‘¨β€πŸ’» Author

Ohad Swissa
GitHub Profile

About

Java simulation of a delivery app using a custom generic min-heap. Built as part of a university Data Structures course.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages