<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:media="http://search.yahoo.com/mrss/"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>优先队列 - 四号程序员</title>
	<atom:link href="https://www.coder4.com/archives/tag/%E4%BC%98%E5%85%88%E9%98%9F%E5%88%97/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Thu, 23 Dec 2021 09:13:36 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.8.3</generator>
	<item>
		<title>Python使用heapq实现小顶堆（TopK大）、大顶堆（BtmK小）</title>
		<link>https://www.coder4.com/archives/3844</link>
					<comments>https://www.coder4.com/archives/3844#comments</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Tue, 12 Mar 2013 08:34:40 +0000</pubDate>
				<category><![CDATA[Python]]></category>
		<category><![CDATA[Bottomk]]></category>
		<category><![CDATA[heapq]]></category>
		<category><![CDATA[Topk]]></category>
		<category><![CDATA[优先队列]]></category>
		<category><![CDATA[堆]]></category>
		<category><![CDATA[大顶堆]]></category>
		<category><![CDATA[小顶堆]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=3844</guid>

					<description><![CDATA[需1求：给出N长的序列，求出TopK大的元素，使用小顶堆，heapq模块实现。 import heapq import random class TopkHeap(object): def __init__(self, k): self.k = k self.data = [] def Push(self, elem): if len(self.data) &#60; self.k:[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/3844/feed</wfw:commentRss>
			<slash:comments>5</slash:comments>
		
		
			</item>
		<item>
		<title>单源最短路径之Java实现（使用Java内置优先队列）</title>
		<link>https://www.coder4.com/archives/475</link>
					<comments>https://www.coder4.com/archives/475#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Thu, 18 Feb 2010 16:40:33 +0000</pubDate>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[Java && J2EE]]></category>
		<category><![CDATA[优先队列]]></category>
		<category><![CDATA[单源最短路径]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=475</guid>

					<description><![CDATA[import java.util.*; /** * 用堆实现了从一个点到其他点的最短路径 * @author */ public class ShortestPath { /**有n个节点*/ private int n; /**节点矩阵*/ private double matrix[][] = null; /**存储单源最短路径*/ private double minpath[]; public ShortestPath(int n) { this.n[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/475/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
