<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"><channel><title>MagicLen</title><link>https://magiclen.org/cn/tag/%E5%BB%A3%E5%BA%A6%E5%84%AA%E5%85%88%E6%90%9C%E5%B0%8B/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 18:31:40 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/%E5%BB%A3%E5%BA%A6%E5%84%AA%E5%85%88%E6%90%9C%E5%B0%8B/feed/" rel="self" type="application/rss+xml"/><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>深度优先搜索(DFS)和广度优先搜索(BFS)算法，实用的节点搜索法</title><link>https://magiclen.org/cn/dfs-bfs/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png" srcset="https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-220x162.png 1x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-440x324.png 2x, https://magiclen.org/wp-content/uploads/2016/04/Searchicons-search-blogs-512-660x486.png 3x" alt>
图(graph)是由节点(node)和边(edge)组合而成的非线性结构，如果我们想要从其中的一个节点开始，走访到其有直接或是间接连接的其它所有节点，可以依靠深度优先搜索法(DFS, Depth-first Search)或是广度优先搜索法(BFS, Breadth-first Search)来达成。]]></description><category>研究分享</category><category>Rust</category><category>算法</category><category>Rust</category><category>搜索算法</category><category>深度优先搜索</category><category>广度优先搜索</category><guid>https://magiclen.org/cn/dfs-bfs</guid><pubDate>Thu, 10 Oct 2019 12:00:01 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>