<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Kahn算法 on Answer</title>
    <link>https://answer.freetools.me/tags/kahn%E7%AE%97%E6%B3%95/</link>
    <description>Recent content in Kahn算法 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 21:02:10 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/kahn%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>拓扑排序如何让任务有条不紊地执行：从Kahn算法到DFS的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E6%8B%93%E6%89%91%E6%8E%92%E5%BA%8F%E5%A6%82%E4%BD%95%E8%AE%A9%E4%BB%BB%E5%8A%A1%E6%9C%89%E6%9D%A1%E4%B8%8D%E7%B4%8A%E5%9C%B0%E6%89%A7%E8%A1%8C%E4%BB%8Ekahn%E7%AE%97%E6%B3%95%E5%88%B0dfs%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 21:02:10 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%8B%93%E6%89%91%E6%8E%92%E5%BA%8F%E5%A6%82%E4%BD%95%E8%AE%A9%E4%BB%BB%E5%8A%A1%E6%9C%89%E6%9D%A1%E4%B8%8D%E7%B4%8A%E5%9C%B0%E6%89%A7%E8%A1%8C%E4%BB%8Ekahn%E7%AE%97%E6%B3%95%E5%88%B0dfs%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>深度解析拓扑排序算法的核心原理，涵盖Kahn算法(BFS)和DFS两种实现方式，并通过12道经典LeetCode题目的Java解法，带你掌握依赖关系处理的核心技巧。</description>
    </item>
  </channel>
</rss>
