<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>算法 · Dayup</title><link>https://abing.cc/categories/%E7%AE%97%E6%B3%95/</link><description>一个干净、克制，专注阅读的博客。</description><generator>Hugo</generator><language>zh-cn</language><managingEditor>Dayup</managingEditor><atom:link href="https://abing.cc/categories/%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml"/><lastBuildDate>Wed, 15 Sep 2021 00:00:00 +0800</lastBuildDate><item><title>广度优先搜索</title><link>https://abing.cc/tech/mhvshfjtxffv/</link><pubDate>Wed, 15 Sep 2021 00:00:00 +0800</pubDate><guid>https://abing.cc/tech/mhvshfjtxffv/</guid><description>广度优先搜索（BFS）：基于队列的树与图遍历实现、时间复杂度分析与小结。</description></item><item><title>深度优先搜索</title><link>https://abing.cc/tech/uulhgkcfkwig/</link><pubDate>Sat, 11 Sep 2021 00:00:00 +0800</pubDate><guid>https://abing.cc/tech/uulhgkcfkwig/</guid><description>深度优先搜索（DFS）：树的前序、中序、后序遍历实现，以及图结构中的 DFS 遍历讲解。</description></item><item><title>高频算法题</title><link>https://abing.cc/tech/fefmmrrgefqh/</link><pubDate>Thu, 14 Jan 2021 00:00:00 +0800</pubDate><guid>https://abing.cc/tech/fefmmrrgefqh/</guid><description>容易考察的高频leetcode题</description></item></channel></rss>