isLouisHsu / isLouisHsu/isLouisHsu.github.io
【数据结构】优先级队列 | LOUIS' BLOG
Open
Nobody has claimed this yet.
8e9b6bd623c16dff69bb344ce24afc3f
Gitalk
- Dominant language
- HTML
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
定义及抽象数据类型优先级队列(priority queue)是$0$个或多个元素的集合，每个元素都有一个优先权或值，在最小优先级队列(min priority queue)中，对其进行的元素操作都是当前优先级最小的，最大优先级队列(max priority queue)则相反。优先级队列的元素可以有相同的优先级，对这些元素其顺序任意。优先级队列的操作有 查找一个元素； 插入一个元素； 删除一个元
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the linked priority-queue article and inspect the repository’s blog content structure to determine whether this issue represents a requested publication or revision. The issue does not identify a file, a specific change, or a completion criterion, so clarify the intended work before making changes.
Written by the indexing model from the issue text.
Assessment
- Domain
- content, documentation
- Issue type
- Documentation
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 15/100