<?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 History</title><link>https://kukie.tech/tags/%EA%B7%B8%EB%9E%98%ED%94%84/</link><description>Recent content in 그래프 on History</description><generator>Hugo</generator><language>ko-kr</language><lastBuildDate>Wed, 06 May 2026 09:00:00 +0900</lastBuildDate><atom:link href="https://kukie.tech/tags/%EA%B7%B8%EB%9E%98%ED%94%84/index.xml" rel="self" type="application/rss+xml"/><item><title>APS.10 Dijkstra, Bellman-Ford &amp; Sliding Puzzle</title><link>https://kukie.tech/posts/aps.10_dijkstra_bellmanford_slidingpuzzle/</link><pubDate>Wed, 06 May 2026 09:00:00 +0900</pubDate><guid>https://kukie.tech/posts/aps.10_dijkstra_bellmanford_slidingpuzzle/</guid><description>Shortest path algorithms (Dijkstra, Bellman-Ford) and BFS-based state-space search illustrated with the sliding puzzle problem.</description></item><item><title>APS.06 Tarjan's SCC Algorithm</title><link>https://kukie.tech/posts/aps.06_scc_tarjan/</link><pubDate>Tue, 14 Apr 2026 09:00:00 +0900</pubDate><guid>https://kukie.tech/posts/aps.06_scc_tarjan/</guid><description>How a single depth-first walk unravels every cycle in a directed graph, without ever looking back.</description></item></channel></rss>