动态优先级队列（堆）实现 [英] Dynamic Priority Queue(heap) implementation

问题描述

大家好，这是我的问题。我必须创建一个动态优先级队列，这是一个 堆 ，而我的书根本没用，所以我没有关于如何创建它的线索。我读了类似静态优先级队列的东西，它是一个数组堆[i]，例如i / 2是我的父亲等等。

静态优先级队列的代码是这样的：

展开 | 选择 | Wrap | 行号

解决方案

如果你有2个月的罢工，那么你可能会在学期放松，所以不要费心去做项目：P：P：P

@Tassos Souris


哈哈哈！ ellhnas eisai？那么实际上不是2个月而是1.5，所以我们会看到...

请解释一下动态优先级队列（堆）是什么。如果优先级是动态的，那么什么事件可以导致它改变？


我相信这个术语的含义是开放的解释，所以我想听听你需要什么

Hello everyone, here is my problem. I have to make a dynamic priority queue,which is a heap, and my book isn''t helpful at all, so I have no clues on how to create it.. I read something like a static priority queue, which is an array heap[i], and for example i/2 is the father of i and so on..
the code of the static priority queue is this:

Expand|Select|Wrap|Line Numbers

解决方案

If you had a strike for 2 months then you are probably loosing the semester so do not bother making the project :P:P:P

@Tassos Souris
hahaha! ellhnas eisai? Well not actually 2 months but 1,5 so we''ll see...

Please explain what a dynamic priority queue(heap) is. If priority is dynamic, then what events can cause it to change?

I believe the meaning of this term is open to interpretation, so I would like to hear what you need it to be.

这篇关于动态优先级队列（堆）实现的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！