<?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>A* on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/a/</link><description>Recent content in A* on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Mon, 09 Feb 2026 09:48:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/a/index.xml" rel="self" type="application/rss+xml"/><item><title>Shortest Path Core Trio: BFS, Dijkstra, and A* ACERS Engineering Breakdown</title><link>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/20-shortest-path-bfs-dijkstra-astar-acers/</link><pubDate>Mon, 09 Feb 2026 09:48:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/20-shortest-path-bfs-dijkstra-astar-acers/</guid><description>A full engineering walkthrough of the shortest-path core trio: BFS for unweighted graphs, Dijkstra for non-negative weights, and heuristic A*. Includes multi-source BFS, bidirectional search, path pruning, and runnable multi-language templates.</description></item></channel></rss>