https://github.com/silent0wings/smarter-priority-queue-spq-adt-implementation

This repository contains the implementation of a Smarter Priority Queue (SPQ) Abstract Data Type (ADT) using a parameterized heap. The SPQ is designed to support both min-heap and max-heap configurations with dynamic adaptability and efficient management.
https://github.com/silent0wings/smarter-priority-queue-spq-adt-implementation

adt adt-implementations adt-template data-structures data-structures-algorithms dsa heap pq priority-queue queue resizable-arrays-implementation resizable-arrays-implemented smart-priority-queue spq tree

Last synced: about 1 month ago
JSON representation

This repository contains the implementation of a Smarter Priority Queue (SPQ) Abstract Data Type (ADT) using a parameterized heap. The SPQ is designed to support both min-heap and max-heap configurations with dynamic adaptability and efficient management.

• Host: GitHub
• URL: https://github.com/silent0wings/smarter-priority-queue-spq-adt-implementation
• Owner: Silent0Wings
• Created: 2024-08-15T05:33:18.000Z (4 months ago)
• Default Branch: main
• Last Pushed: 2024-10-31T08:25:20.000Z (about 2 months ago)
• Last Synced: 2024-10-31T09:24:07.646Z (about 2 months ago)
• Topics: adt, adt-implementations, adt-template, data-structures, data-structures-algorithms, dsa, heap, pq, priority-queue, queue, resizable-arrays-implementation, resizable-arrays-implemented, smart-priority-queue, spq, tree
• Language: Java
• Homepage:
• Size: 322 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Smarter-Priority-Queue-SPQ-ADT-Implementation

This repository contains the implementation of a Smarter Priority Queue (SPQ) Abstract Data Type (ADT) using a parameterized heap. The SPQ is designed to support both min-heap and max-heap configurations with dynamic adaptability and efficient management.



    



### Project Overview

[Full Repport](https://github.com/Silent0Wings/Smarter-Priority-Queue-SPQ-ADT-Implementation/blob/1e9b89b6d74bec028efee7a05d586e81d9a413eb/Github_.pdf)

The SPQ utilizes a dynamic array for the heap implementation, allowing it to flexibly handle operations as either a min-heap or max-heap based on the current configuration. This dual functionality is pivotal in applications requiring priority assessments from both ends of the spectrum.

### Key Features

- **Dual Heap Configuration**: Seamlessly transitions between min-heap and max-heap configurations.

- **Dynamic Array Implementation**: Custom extendable array to handle dynamic data sets.

- **Adaptive Operations**: Includes `toggle()`, `insert()`, `removeTop()`, and other essential operations, enabling switching between modes and dynamic data handling.

### Core Components

- `Entry`: Manages data entries within the queue, associating data with priorities and managing their positions within the array for efficient access.

- `ExpandingArray`: Facilitates the dynamic resizing of the array, ensuring efficient memory usage and allocation.

- `PriorityQueueHeap`: Acts as the main class, implementing various priority queue operations while maintaining heap properties regardless of the current heap type.

## Implementation

The SPQ ADT is built on a parameterized heap structure that supports extensive manipulation of data with optimized operations for insertion, deletion, and access based on the heap type.

### Implemented Methods

- `toggle()`: Alters the heap's configuration between minimum and maximum orientations.

- `insert(k, v)`: Adds a new key-value pair and restructures the heap accordingly.

- `removeTop()`: Extracts the highest or lowest element based on the heap's current state.

- `replaceKey(e, k)`, `replaceValue(e, v)`: Modifies existing entries in the heap to maintain order and integrity.

## Usage

Clone this repository and integrate it into your Java development environment to leverage the SPQ in your applications.