進階圖論涵蓋最短路徑（Dijkstra）、最小生成樹（Prim/Kruskal）、拓撲排序等演算法，用於解決更複雜的圖問題。
Notes:
- Dijkstra 適用於非負權重的最短路徑
- Bellman-Ford 可處理負權重邊
- Prim/Kruskal 用於最小生成樹
跨倉庫導讀#
- 對應理論章節：圖 ↗
#269
Alien Dictionary
#332
Reconstruct Itinerary
#743
Network Delay Time
#778
Swim in Rising Water
#787
Cheapest Flights Within K Stops
#1489
Find Critical and Pseudo Critical Edges in Minimum Spanning Tree
#1514
Path with Maximum Probability
#1579
Remove Max Number of Edges to Keep Graph Fully Traversable
#1584
Min Cost to Connect All Points
#1631
Path with Minimum Effort
#2421
Number of Good Paths