<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graphs &amp; Pathfinding on Ryan Knopp</title><link>https://ryanrk.com/algorithms/graphs/</link><description>Recent content in Graphs &amp; Pathfinding on Ryan Knopp</description><language>en-US</language><copyright>2026</copyright><lastBuildDate>Thu, 19 Nov 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://ryanrk.com/algorithms/graphs/index.xml" rel="self" type="application/rss+xml"/><item><title>Breadth-First Search</title><link>https://ryanrk.com/algorithms/graphs/breadth-first-search/</link><guid>https://ryanrk.com/algorithms/graphs/breadth-first-search/</guid><pubDate>Thu, 19 Nov 2026 00:00:00 +0000</pubDate><atom:updated>2026-11-19T00:00:00+00:00</atom:updated><author>ryan@theknopps.com (Ryan Knopp)</author><description>Breadth-first search fans out one layer at a time. Watch its queue grow and see why the first route it finds through an unweighted graph is always a shortest path.</description></item><item><title>Comparing Pathfinding Algorithms</title><link>https://ryanrk.com/algorithms/graphs/compare/</link><guid>https://ryanrk.com/algorithms/graphs/compare/</guid><pubDate>Thu, 19 Nov 2026 00:00:00 +0000</pubDate><atom:updated>2026-11-19T00:00:00+00:00</atom:updated><author>ryan@theknopps.com (Ryan Knopp)</author><description>Give every algorithm the same maze. Compare how far each explores, how many moves its route takes, and what that route costs.</description></item></channel></rss>