<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Dust_NLL的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Dust_NLL</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Dust_NLL]]></copyright><item><title><![CDATA[简单数据结构]]></title><link>https://blog.youkuaiyun.com/Dust_NLL/article/details/136102214</link><guid>https://blog.youkuaiyun.com/Dust_NLL/article/details/136102214</guid><author>Dust_NLL</author><pubDate>Wed, 14 Feb 2024 01:00:00 +0800</pubDate><description><![CDATA[数据结构是储存数据的方式一种用节点和边链接而成的非线性结构连通块：节点之间满足两两联通的部分满足边的数量=节点数量 - 1的联通图。]]></description><category></category></item><item><title><![CDATA[割边和割点]]></title><link>https://blog.youkuaiyun.com/Dust_NLL/article/details/136102209</link><guid>https://blog.youkuaiyun.com/Dust_NLL/article/details/136102209</guid><author>Dust_NLL</author><pubDate>Tue, 13 Feb 2024 05:00:00 +0800</pubDate><description><![CDATA[图论基础算法之割边割点基础]]></description><category></category></item><item><title><![CDATA[平衡树初步——Treap]]></title><link>https://blog.youkuaiyun.com/Dust_NLL/article/details/136102167</link><guid>https://blog.youkuaiyun.com/Dust_NLL/article/details/136102167</guid><author>Dust_NLL</author><pubDate>Mon, 12 Feb 2024 17:47:18 +0800</pubDate><description><![CDATA[平衡树算是比较进阶一点的数据结构，这里只是对学习简单平衡树的记录。]]></description><category></category></item></channel></rss>