https://ai-blog.noorshomelab.dev/tags/dijkstra/Recent content in Dijkstra on AI VOIDHugoenMon, 16 Feb 2026 00:00:00 +0000https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/project-route-finder/Mon, 16 Feb 2026 00:00:00 +0000https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/project-route-finder/<h2 id="introduction-charting-your-own-course">Introduction: Charting Your Own Course</h2> <p>Welcome to Chapter 23! So far, we&rsquo;ve explored the fascinating world of graphs, understanding how they represent interconnected data. We&rsquo;ve seen nodes, edges, and different ways to traverse them. Now, it&rsquo;s time to put that knowledge into action with a super practical and engaging project: building your very own <strong>Route Finder!</strong></p> <p>Imagine you&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&rsquo;s. In this chapter, we&rsquo;ll model a small network of &ldquo;cities&rdquo; and &ldquo;roads&rdquo; as a graph, then implement a classic algorithm to discover the shortest path between any two points. This isn&rsquo;t just a theoretical exercise; it’s the fundamental concept behind GPS systems, network routing protocols, and even social media friend recommendations.</p>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/advanced-graph-algorithms/Mon, 16 Feb 2026 00:00:00 +0000https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/advanced-graph-algorithms/<h2 id="introduction">Introduction</h2> <p>Welcome to Chapter 15! We&rsquo;ve journeyed through the fundamentals of graphs, understanding how to represent them and perform basic traversals like Breadth-First Search (BFS) and Depth-First Search (DFS). Now, it&rsquo;s time to elevate our graph game and tackle one of the most practical and fascinating problems in computer science: finding the shortest path between nodes.</p> <p>In this chapter, you&rsquo;ll dive deep into advanced graph algorithms designed specifically for shortest path problems. We&rsquo;ll explore Dijkstra&rsquo;s Algorithm, a classic for graphs with non-negative edge weights, and then move on to Bellman-Ford, which gracefully handles negative edge weights and even detects negative cycles. Finally, we&rsquo;ll touch upon Floyd-Warshall, an elegant solution for finding all-pairs shortest paths.</p>