<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Pathfinding on AI VOID</title><link>https://ai-blog.noorshomelab.dev/tags/pathfinding/</link><description>Recent content in Pathfinding on AI VOID</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 16 Feb 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://ai-blog.noorshomelab.dev/tags/pathfinding/index.xml" rel="self" type="application/rss+xml"/><item><title>Chapter 23: Hands-On Project: Route Finder with Graphs</title><link>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/project-route-finder/</link><pubDate>Mon, 16 Feb 2026 00:00:00 +0000</pubDate><guid>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/project-route-finder/</guid><description>&lt;h2 id="introduction-charting-your-own-course"&gt;Introduction: Charting Your Own Course&lt;/h2&gt;
&lt;p&gt;Welcome to Chapter 23! So far, we&amp;rsquo;ve explored the fascinating world of graphs, understanding how they represent interconnected data. We&amp;rsquo;ve seen nodes, edges, and different ways to traverse them. Now, it&amp;rsquo;s time to put that knowledge into action with a super practical and engaging project: building your very own &lt;strong&gt;Route Finder!&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Imagine you&amp;rsquo;re developing a simple navigation app. How does it figure out the best way to get from point A to point B? The answer, often, lies in graph theory and powerful algorithms like Dijkstra&amp;rsquo;s. In this chapter, we&amp;rsquo;ll model a small network of &amp;ldquo;cities&amp;rdquo; and &amp;ldquo;roads&amp;rdquo; as a graph, then implement a classic algorithm to discover the shortest path between any two points. This isn&amp;rsquo;t just a theoretical exercise; it’s the fundamental concept behind GPS systems, network routing protocols, and even social media friend recommendations.&lt;/p&gt;</description></item></channel></rss>