<?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>Graph Algo on Ishian</title><link>https://echo.ishian.me/categories/graph-algo/</link><description>Recent content in Graph Algo on Ishian</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 11 Feb 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://echo.ishian.me/categories/graph-algo/index.xml" rel="self" type="application/rss+xml"/><item><title>图的算法: SCC（强连通分量）</title><link>https://echo.ishian.me/2025/02/11/algo-graph-scc/</link><pubDate>Tue, 11 Feb 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/02/11/algo-graph-scc/</guid><description>给出Tarjan算法求解有向图强连通分量并缩点建图的完整代码实现</description></item><item><title>图的算法: 最小生成树</title><link>https://echo.ishian.me/2024/12/09/algo-graph-minimum-spanning-tree/</link><pubDate>Mon, 09 Dec 2024 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2024/12/09/algo-graph-minimum-spanning-tree/</guid><description>从图论基础与图的存储讲起，介绍最小生成树的概念及Prim、Kruskal等算法</description></item></channel></rss>