<?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>Contraction Hierarchies on Engineering Playbook</title><link>https://learn.tanhdev.com/tags/contraction-hierarchies/</link><description>Recent content in Contraction Hierarchies on Engineering Playbook</description><image><title>Engineering Playbook</title><url>https://learn.tanhdev.com/vesviet.png</url><link>https://learn.tanhdev.com/vesviet.png</link></image><generator>Hugo</generator><language>vi</language><lastBuildDate>Sun, 16 Aug 2026 12:00:00 +0700</lastBuildDate><atom:link href="https://learn.tanhdev.com/tags/contraction-hierarchies/index.xml" rel="self" type="application/rss+xml"/><item><title>Phần 1: Trực Quan Hóa Thuật Toán Cốt Lõi (A*, Dijkstra)</title><link>https://learn.tanhdev.com/series/routing-geospatial-architecture/part-1-core-algorithms/</link><pubDate>Sun, 14 Jun 2026 22:35:00 +0700</pubDate><guid>https://learn.tanhdev.com/series/routing-geospatial-architecture/part-1-core-algorithms/</guid><description>Mổ xẻ sâu vào các thuật toán cốt lõi làm nên năng lực xử lý của ngành logistics hiện đại. Tìm hiểu tại sao Dijkstra lại ăn đứt A* trong bài toán Ma trận Khoảng cách.</description></item></channel></rss>