<?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>Bfs on wid's blog</title><link>https://wid-blog.github.io/en/tags/bfs/</link><description>Recent content in Bfs on wid's blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Fri, 03 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://wid-blog.github.io/en/tags/bfs/index.xml" rel="self" type="application/rss+xml"/><item><title>Topological Sort — Process Zero In-degree First</title><link>https://wid-blog.github.io/en/posts/tech/algorithm/topological-sort/</link><pubDate>Fri, 03 Jul 2026 00:00:00 +0000</pubDate><guid>https://wid-blog.github.io/en/posts/tech/algorithm/topological-sort/</guid><description>Kahn&amp;rsquo;s BFS for topological sort repeatedly takes nodes with zero in-degree, and cycle detection comes along without extra logic. The mechanism, the Course Schedule problems, and the selection criteria against DFS post-order.</description></item></channel></rss>