<?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>匈牙利算法 on Answer</title>
    <link>https://answer.freetools.me/tags/%E5%8C%88%E7%89%99%E5%88%A9%E7%AE%97%E6%B3%95/</link>
    <description>Recent content in 匈牙利算法 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Mon, 09 Mar 2026 00:00:23 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%8C%88%E7%89%99%E5%88%A9%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>二分图匹配为何能用增广路不断扩充：从匈牙利算法到Hopcroft-Karp的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E4%BA%8C%E5%88%86%E5%9B%BE%E5%8C%B9%E9%85%8D%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E5%A2%9E%E5%B9%BF%E8%B7%AF%E4%B8%8D%E6%96%AD%E6%89%A9%E5%85%85%E4%BB%8E%E5%8C%88%E7%89%99%E5%88%A9%E7%AE%97%E6%B3%95%E5%88%B0hopcroft-karp%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Mon, 09 Mar 2026 00:00:23 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%BA%8C%E5%88%86%E5%9B%BE%E5%8C%B9%E9%85%8D%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E5%A2%9E%E5%B9%BF%E8%B7%AF%E4%B8%8D%E6%96%AD%E6%89%A9%E5%85%85%E4%BB%8E%E5%8C%88%E7%89%99%E5%88%A9%E7%AE%97%E6%B3%95%E5%88%B0hopcroft-karp%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>深入解析二分图最大匹配问题，从增广路定理到匈牙利算法的实现原理，再到Hopcroft-Karp算法的复杂度优化，配合LeetCode经典题目的Java完整解答。</description>
    </item>
  </channel>
</rss>
