[FEATURE] Indexed priority queue

[ron0studios]

Detailed description

I'd like to write an implementation for an indexed priority queue data structure for the project. It will be relatively simple, and mainly for educational purposes. I will write a class for an indexed priority queue that will be can hold any value type and a comparable type for the priority value. It will have the same time complexities of a regular priority queue, with the benefit of having access at O(1).

The implementation will follow along the lines of william fiset's video tutorial: https://youtu.be/jND_WJ8r7FE

Context

A lot of graph algorithms that use priority queues to improve their time complexities, such as prim's algorithm and dijkstra.

Possible implementation

I have the code ready and will make a pull request after cleaning up and adhering to the project's code of conduct

Additional information

No response

[Panquesito7]

Thank you for your interest in contributing! 🎉 Before submitting a PR, please ensure the following:

• The algorithm/implementation isn't a duplicate in this repository.
• Make your code per the repository standards.
• Ensure that all the automated-tests pass.

[ron0studios]

Just made one, thanks!

[Sakshi2002-Sinha]

Hello, Can you please assign this issue to me? Thanks in advance :)

[PrakarshSingh5]

hi sir plz assign this work to me

[ron0studios]

Hello, Can you please assign this issue to me? Thanks in advance :)

I'm already working on it, sorry

[PrakarshSingh5]

Ohk no problem

On Fri, 14 Oct 2022, 9:15 pm Ron0Studios, @.***> wrote:

Hello, Can you please assign this issue to me? Thanks in advance :)

I'm already working on it, sorry

— Reply to this email directly, view it on GitHub https://github.com/TheAlgorithms/C-Plus-Plus/issues/2160#issuecomment-1279174169, or unsubscribe https://github.com/notifications/unsubscribe-auth/AZ4JIRQ6N2BG3LYS6FZIIJLWDF53NANCNFSM6AAAAAAQ65LMG4 . You are receiving this because you commented.Message ID: @.***>

[github-actions[bot]]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!