<?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 wid's blog</title><link>https://wid-blog.github.io/tags/%EC%9C%84%EC%83%81%EC%A0%95%EB%A0%AC/</link><description>Recent content in 위상정렬 on wid's blog</description><generator>Hugo</generator><language>ko</language><lastBuildDate>Fri, 03 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://wid-blog.github.io/tags/%EC%9C%84%EC%83%81%EC%A0%95%EB%A0%AC/index.xml" rel="self" type="application/rss+xml"/><item><title>위상정렬 — 진입차수 0 부터 처리한다</title><link>https://wid-blog.github.io/posts/tech/algorithm/topological-sort/</link><pubDate>Fri, 03 Jul 2026 00:00:00 +0000</pubDate><guid>https://wid-blog.github.io/posts/tech/algorithm/topological-sort/</guid><description>위상정렬의 Kahn BFS 는 진입차수 0 인 노드를 반복해서 꺼내 처리하는 알고리즘이고, 사이클 검출은 별도 로직 없이 따라온다. Kahn BFS 의 메커니즘, Course Schedule 유형, DFS post-order 와의 선택 기준.</description></item></channel></rss>