{"id":19880096,"url":"https://github.com/silent0wings/smarter-priority-queue-spq-adt-implementation","last_synced_at":"2025-09-01T01:08:20.153Z","repository":{"id":253204153,"uuid":"842799332","full_name":"Silent0Wings/Smarter-Priority-Queue-SPQ-ADT-Implementation","owner":"Silent0Wings","description":"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.","archived":false,"fork":false,"pushed_at":"2024-10-31T08:25:20.000Z","size":330,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-01T02:44:11.266Z","etag":null,"topics":["abstract-data-type","adt","adt-implementations","adt-template","data-structures","data-structures-algorithms","dsa","dynamic-queue","heap","java","optimized-queue","pq","priority-queue","queue","resizable-arrays-implementation","resizable-arrays-implemented","smart-priority-queue","spq","tree"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Silent0Wings.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-08-15T05:33:18.000Z","updated_at":"2025-01-12T08:03:56.000Z","dependencies_parsed_at":"2024-11-12T17:10:16.219Z","dependency_job_id":"d0fa3072-36fe-4d1c-a02d-c857a5b74611","html_url":"https://github.com/Silent0Wings/Smarter-Priority-Queue-SPQ-ADT-Implementation","commit_stats":null,"previous_names":["silent0wings/smarter-priority-queue-spq-adt-implementation"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Silent0Wings/Smarter-Priority-Queue-SPQ-ADT-Implementation","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FSmarter-Priority-Queue-SPQ-ADT-Implementation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FSmarter-Priority-Queue-SPQ-ADT-Implementation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FSmarter-Priority-Queue-SPQ-ADT-Implementation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FSmarter-Priority-Queue-SPQ-ADT-Implementation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Silent0Wings","download_url":"https://codeload.github.com/Silent0Wings/Smarter-Priority-Queue-SPQ-ADT-Implementation/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Silent0Wings%2FSmarter-Priority-Queue-SPQ-ADT-Implementation/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273061075,"owners_count":25038596,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-31T02:00:09.071Z","response_time":79,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["abstract-data-type","adt","adt-implementations","adt-template","data-structures","data-structures-algorithms","dsa","dynamic-queue","heap","java","optimized-queue","pq","priority-queue","queue","resizable-arrays-implementation","resizable-arrays-implemented","smart-priority-queue","spq","tree"],"created_at":"2024-11-12T17:10:14.296Z","updated_at":"2025-09-01T01:08:20.130Z","avatar_url":"https://github.com/Silent0Wings.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Smarter-Priority-Queue-SPQ-ADT-Implementation\n\nThis 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.\n\n\u003c!-- Using HTML to set the width --\u003e\n\u003cp align=\"center\"\u003e\n    \u003cimg src=\"https://github.com/Silent0Wings/Smarter-Priority-Queue-SPQ-ADT-Implementation/blob/ac0fec116405b1a92af00ff598ba523c32663dd0/SPQ/UML.png\" alt=\"UML Diagram\" width=\"250\"/\u003e\n\u003c/p\u003e\n\n### Project Overview\n\n[Full Repport](https://github.com/Silent0Wings/Smarter-Priority-Queue-SPQ-ADT-Implementation/blob/1e9b89b6d74bec028efee7a05d586e81d9a413eb/Github_.pdf)\n\nThe 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.\n\n### Key Features\n\n- **Dual Heap Configuration**: Seamlessly transitions between min-heap and max-heap configurations.\n- **Dynamic Array Implementation**: Custom extendable array to handle dynamic data sets.\n- **Adaptive Operations**: Includes `toggle()`, `insert()`, `removeTop()`, and other essential operations, enabling switching between modes and dynamic data handling.\n\n### Core Components\n\n- `Entry`: Manages data entries within the queue, associating data with priorities and managing their positions within the array for efficient access.\n- `ExpandingArray`: Facilitates the dynamic resizing of the array, ensuring efficient memory usage and allocation.\n- `PriorityQueueHeap`: Acts as the main class, implementing various priority queue operations while maintaining heap properties regardless of the current heap type.\n\n## Implementation\n\nThe 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.\n\n### Implemented Methods\n\n- `toggle()`: Alters the heap's configuration between minimum and maximum orientations.\n- `insert(k, v)`: Adds a new key-value pair and restructures the heap accordingly.\n- `removeTop()`: Extracts the highest or lowest element based on the heap's current state.\n- `replaceKey(e, k)`, `replaceValue(e, v)`: Modifies existing entries in the heap to maintain order and integrity.\n\n## Usage\n\nClone this repository and integrate it into your Java development environment to leverage the SPQ in your applications.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsilent0wings%2Fsmarter-priority-queue-spq-adt-implementation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsilent0wings%2Fsmarter-priority-queue-spq-adt-implementation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsilent0wings%2Fsmarter-priority-queue-spq-adt-implementation/lists"}