<?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>Dijkstra on danilchenko.dev</title><link>https://www.danilchenko.dev/tags/dijkstra/</link><description>Recent content in Dijkstra on danilchenko.dev</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Thu, 13 Aug 2026 08:24:11 +0000</lastBuildDate><atom:link href="https://www.danilchenko.dev/tags/dijkstra/index.xml" rel="self" type="application/rss+xml"/><item><title>Faster Than Dijkstra: The New Shortest-Path Algorithm, Explained</title><link>https://www.danilchenko.dev/posts/faster-than-dijkstra/</link><pubDate>Thu, 13 Aug 2026 08:24:11 +0000</pubDate><guid>https://www.danilchenko.dev/posts/faster-than-dijkstra/</guid><description>A new shortest path algorithm finally beats Dijkstra on sparse graphs. How it breaks the 65-year sorting barrier, and why Dijkstra still wins in practice.</description></item></channel></rss>