<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[regens的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/regens</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; regens]]></copyright><item><title><![CDATA[加权有向图]]></title><link>https://blog.youkuaiyun.com/regens/article/details/124148216</link><guid>https://blog.youkuaiyun.com/regens/article/details/124148216</guid><author>regens</author><pubDate>Wed, 13 Apr 2022 14:55:49 +0800</pubDate><description><![CDATA[加权有向图]]></description><category></category></item><item><title><![CDATA[加权无向图的实现]]></title><link>https://blog.youkuaiyun.com/regens/article/details/124140335</link><guid>https://blog.youkuaiyun.com/regens/article/details/124140335</guid><author>regens</author><pubDate>Wed, 13 Apr 2022 09:31:24 +0800</pubDate><description><![CDATA[加权无向图]]></description><category></category></item><item><title><![CDATA[拓扑排序的实现]]></title><link>https://blog.youkuaiyun.com/regens/article/details/124122372</link><guid>https://blog.youkuaiyun.com/regens/article/details/124122372</guid><author>regens</author><pubDate>Tue, 12 Apr 2022 13:58:54 +0800</pubDate><description><![CDATA[拓扑排序]]></description><category></category></item><item><title><![CDATA[有向图实现]]></title><link>https://blog.youkuaiyun.com/regens/article/details/124100930</link><guid>https://blog.youkuaiyun.com/regens/article/details/124100930</guid><author>regens</author><pubDate>Mon, 11 Apr 2022 15:43:11 +0800</pubDate><description><![CDATA[有向图]]></description><category></category></item><item><title><![CDATA[图的路径查找]]></title><link>https://blog.youkuaiyun.com/regens/article/details/124066084</link><guid>https://blog.youkuaiyun.com/regens/article/details/124066084</guid><author>regens</author><pubDate>Sat, 09 Apr 2022 19:15:57 +0800</pubDate><description><![CDATA[图的路径查找]]></description><category></category></item><item><title><![CDATA[图的应用案例：畅通工程]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123952397</link><guid>https://blog.youkuaiyun.com/regens/article/details/123952397</guid><author>regens</author><pubDate>Mon, 04 Apr 2022 13:22:42 +0800</pubDate><description><![CDATA[畅通工程（图的应用）]]></description><category></category></item><item><title><![CDATA[图的定义、分类及实现]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123952288</link><guid>https://blog.youkuaiyun.com/regens/article/details/123952288</guid><author>regens</author><pubDate>Mon, 04 Apr 2022 13:19:14 +0800</pubDate><description><![CDATA[图的实现：邻接表]]></description><category></category></item><item><title><![CDATA[并查集——案例（畅通工程）]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123917949</link><guid>https://blog.youkuaiyun.com/regens/article/details/123917949</guid><author>regens</author><pubDate>Sat, 02 Apr 2022 13:15:10 +0800</pubDate><description><![CDATA[并查集实例运用]]></description><category></category></item><item><title><![CDATA[并查集（普通版）]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123917472</link><guid>https://blog.youkuaiyun.com/regens/article/details/123917472</guid><author>regens</author><pubDate>Sat, 02 Apr 2022 12:36:23 +0800</pubDate><description><![CDATA[并查集的实现与优化]]></description><category></category></item><item><title><![CDATA[B树的概念及应用]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123916901</link><guid>https://blog.youkuaiyun.com/regens/article/details/123916901</guid><author>regens</author><pubDate>Sat, 02 Apr 2022 12:29:43 +0800</pubDate><description><![CDATA[B+树：



B树和B+树的对比：

B+树在数据库中的应用：




]]></description><category></category></item><item><title><![CDATA[红黑树的实现]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123896756</link><guid>https://blog.youkuaiyun.com/regens/article/details/123896756</guid><author>regens</author><pubDate>Fri, 01 Apr 2022 14:43:58 +0800</pubDate><description><![CDATA[红黑树的实现]]></description><category></category></item><item><title><![CDATA[最小索引优先队列（利用堆来实现）]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123838471</link><guid>https://blog.youkuaiyun.com/regens/article/details/123838471</guid><author>regens</author><pubDate>Wed, 30 Mar 2022 09:54:25 +0800</pubDate><description><![CDATA[索引优先队列]]></description><category></category></item><item><title><![CDATA[最小优先队列]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123811313</link><guid>https://blog.youkuaiyun.com/regens/article/details/123811313</guid><author>regens</author><pubDate>Tue, 29 Mar 2022 08:49:14 +0800</pubDate><description><![CDATA[最小优先队列]]></description><category></category></item><item><title><![CDATA[最大优先队列]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123811272</link><guid>https://blog.youkuaiyun.com/regens/article/details/123811272</guid><author>regens</author><pubDate>Tue, 29 Mar 2022 08:46:25 +0800</pubDate><description><![CDATA[优先队列的实现]]></description><category></category></item><item><title><![CDATA[堆排序的实现]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123795364</link><guid>https://blog.youkuaiyun.com/regens/article/details/123795364</guid><author>regens</author><pubDate>Mon, 28 Mar 2022 15:04:14 +0800</pubDate><description><![CDATA[堆排序]]></description><category></category></item><item><title><![CDATA[堆的结构及实现]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123787173</link><guid>https://blog.youkuaiyun.com/regens/article/details/123787173</guid><author>regens</author><pubDate>Mon, 28 Mar 2022 09:37:00 +0800</pubDate><description><![CDATA[堆的结构及实现]]></description><category></category></item><item><title><![CDATA[折纸问题（利用树的模型解决）]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123761410</link><guid>https://blog.youkuaiyun.com/regens/article/details/123761410</guid><author>regens</author><pubDate>Sat, 26 Mar 2022 19:43:47 +0800</pubDate><description><![CDATA[折纸问题]]></description><category></category></item><item><title><![CDATA[二叉树最大深度问题]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123760636</link><guid>https://blog.youkuaiyun.com/regens/article/details/123760636</guid><author>regens</author><pubDate>Sat, 26 Mar 2022 18:16:42 +0800</pubDate><description><![CDATA[二叉树最大深度问题]]></description><category></category></item><item><title><![CDATA[二叉树的遍历（前序遍历，中序遍历，后序遍历，层次遍历）Java实现]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123751128</link><guid>https://blog.youkuaiyun.com/regens/article/details/123751128</guid><author>regens</author><pubDate>Sat, 26 Mar 2022 10:15:18 +0800</pubDate><description><![CDATA[二叉树的遍历（前序，中序，后续，层次）]]></description><category></category></item><item><title><![CDATA[二叉树（最小值，最大值问题）]]></title><link>https://blog.youkuaiyun.com/regens/article/details/123751006</link><guid>https://blog.youkuaiyun.com/regens/article/details/123751006</guid><author>regens</author><pubDate>Sat, 26 Mar 2022 10:00:32 +0800</pubDate><description><![CDATA[求二叉树中最小值和最大值问题]]></description><category></category></item></channel></rss>