<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graph on</title><link>https://h30306.github.io/blog/zh-tw/tags/graph/</link><description>Recent content in Graph on</description><generator>Hugo -- gohugo.io</generator><language>zh-tw</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Sun, 13 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/graph/index.xml" rel="self" type="application/rss+xml"/><item><title>Shortest Path</title><link>https://h30306.github.io/blog/zh-tw/algorithm/shortest-path/</link><pubDate>Sun, 13 Sep 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/algorithm/shortest-path/</guid><description>Dijkstra、minimax path 與有邊數限制的 Bellman-Ford</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/algorithm/shortest-path/featured.png"/></item><item><title>Topological Sort</title><link>https://h30306.github.io/blog/zh-tw/algorithm/topological-sort/</link><pubDate>Sun, 13 Sep 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/algorithm/topological-sort/</guid><description>排序、cycle detection、dependency unlocking 與 graph propagation</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/algorithm/topological-sort/featured.png"/></item><item><title>LeetCode 743: Network Delay Time</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-743/</link><pubDate>Fri, 01 May 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-743/</guid><description>LeetCode 743 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-743/featured.png"/></item><item><title>LeetCode 269: Alien Dictionary</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-269/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-269/</guid><description>LeetCode 269 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-269/featured.png"/></item><item><title>LeetCode 1631: Path With Minimum Effort</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1631/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1631/</guid><description>LeetCode 1631 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-1631/featured.png"/></item><item><title>LeetCode 787: Cheapest Flights Within K Stops</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-787/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-787/</guid><description>LeetCode 787 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-787/featured.png"/></item><item><title>LeetCode 778: Swim in Rising Water</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-778/</link><pubDate>Sat, 18 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-778/</guid><description>LeetCode 778 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-778/featured.png"/></item><item><title>LeetCode 1203: Sort Items by Groups Respecting Dependencies</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1203/</link><pubDate>Mon, 13 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1203/</guid><description>LeetCode 1203 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-1203/featured.png"/></item><item><title>LeetCode 802: Find Eventual Safe States</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-802/</link><pubDate>Mon, 13 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-802/</guid><description>LeetCode 802 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-802/featured.png"/></item><item><title>LeetCode 851: Loud and Rich</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-851/</link><pubDate>Mon, 13 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-851/</guid><description>LeetCode 851 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-851/featured.png"/></item><item><title>LeetCode 2115: Find All Possible Recipes from Given Supplies</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2115/</link><pubDate>Sat, 11 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2115/</guid><description>LeetCode 2115 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-2115/featured.png"/></item><item><title>LeetCode 310: Minimum Height Trees</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-310/</link><pubDate>Sat, 11 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-310/</guid><description>LeetCode 310 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-310/featured.png"/></item><item><title>LeetCode 1971: Find if Path Exists in Graph</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1971/</link><pubDate>Wed, 08 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1971/</guid><description>LeetCode 1971 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-1971/featured.png"/></item><item><title>LeetCode 207: Course Schedule</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-207/</link><pubDate>Wed, 08 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-207/</guid><description>LeetCode 207 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-207/featured.png"/></item><item><title>LeetCode 210: Course Schedule II</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-210/</link><pubDate>Wed, 08 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-210/</guid><description>LeetCode 210 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-210/featured.png"/></item><item><title>LeetCode 2192: All Ancestors of a Node in a DAG</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2192/</link><pubDate>Wed, 08 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2192/</guid><description>LeetCode 2192 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-2192/featured.png"/></item></channel></rss>