--- title: "#dijkstra articles | Hashnode" description: "Explore 31 articles tagged #dijkstra on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/dijkstra" --- Tag # #dijkstra 31 posts · 0 followers [Lim Woojae](https://hashnode.com/@jaylog) · [Jul 22](https://hashnode.com/posts/cs-fundamentals-greedy-dijkstra-kruskal-and-prim-s-algorithm/6a60dee33bf038f7b9a8f2af) ### [\[CS fundamentals\] Greedy - Dijkstra, Kruskal and Prim's Algorithm](https://jaylog.hashnode.dev/cs-fundamentals-greedy-dijkstra-kruskal-and-prim-s-algorithm?utm_source=hashnode&utm_medium=feed) Think about how Google Maps finds the shortest path from your home to your favorite restaurant. Each traffic light might represent a vertex of a graph 6 min read · [jaylog.hashnode.dev](https://jaylog.hashnode.dev/cs-fundamentals-greedy-dijkstra-kruskal-and-prim-s-algorithm?utm_source=hashnode&utm_medium=feed) [Beau Carnes](https://hashnode.com/@beaucarnes) · [Jul 16](https://hashnode.com/posts/understanding-dijkstra-s-algorithm/6a58c0ae78ff326927bcf6bc) ### [Understanding Dijkstra's Algorithm](https://freecodecamp.org/news/understanding-dijkstra-s-algorithm?utm_source=hashnode&utm_medium=feed) In 1956, a young programmer was taking his girlfriend shopping in Amsterdam. Feeling tired, they sat down at a cafe terrace for a cup of coffee. In the 20 minutes it took to finish their drinks, he co 2 min read · [freecodecamp.org](https://freecodecamp.org/news/understanding-dijkstra-s-algorithm?utm_source=hashnode&utm_medium=feed) [Alex Mateo](https://hashnode.com/@alexmateo) · [May 10](https://hashnode.com/posts/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra/6a004c68e3eebc2e20584ea5) ### [Graph Algorithms for Coding Interviews: When to Use BFS, DFS, or Dijkstra](https://alexmateo.hashnode.dev/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra?utm_source=hashnode&utm_medium=feed) Learn when to use BFS, DFS, or Dijkstra in coding interviews. Decision framework, complexity, and classic problems for each algorithm. 11 min read · [alexmateo.hashnode.dev](https://alexmateo.hashnode.dev/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra?utm_source=hashnode&utm_medium=feed) [Yejun Park](https://hashnode.com/@yejun) · [May 8](https://hashnode.com/posts/the-banker-s-algorithm-how-operating-systems-avoid-deadlock/69fde85df239332df4c8859d) ### [The Banker's Algorithm: How Operating Systems Avoid Deadlock](https://yejunpark3.hashnode.dev/the-banker-s-algorithm-how-operating-systems-avoid-deadlock?utm_source=hashnode&utm_medium=feed) A beginner-friendly guide to one of the most elegant ideas in computer science 6 min read · [yejunpark3.hashnode.dev](https://yejunpark3.hashnode.dev/the-banker-s-algorithm-how-operating-systems-avoid-deadlock?utm_source=hashnode&utm_medium=feed) [Aanya Kathuria](https://hashnode.com/@aanyakathuria) · [Mar 31](https://hashnode.com/posts/why-recomputing-shortest-paths-is-inefficient-a-step-towards-smarter-graph-algorithms/69cbfdb0c1e86567d7651992) ### [Why Recomputing Shortest Paths Is Inefficient: A Step Towards Smarter Graph Algorithms](https://graphnotes.hashnode.dev/why-recomputing-shortest-paths-is-inefficient-a-step-towards-smarter-graph-algorithms?utm_source=hashnode&utm_medium=feed) A Step Towards Smarter Graph Algorithms 5 min read · [graphnotes.hashnode.dev](https://graphnotes.hashnode.dev/why-recomputing-shortest-paths-is-inefficient-a-step-towards-smarter-graph-algorithms?utm_source=hashnode&utm_medium=feed) [Akshat Jain](https://hashnode.com/@akshatjme) · [Mar 7](https://hashnode.com/posts/optimal-route-planning-in-delhi-metro-using-graph-algorithms/69ac2687de78b17566cde509) ### [Optimal Route Planning in Delhi Metro Using Graph Algorithms](https://akshatjme.hashnode.dev/optimal-route-planning-in-delhi-metro-using-graph-algorithms?utm_source=hashnode&utm_medium=feed) Anyone who has travelled in the Delhi Metro knows an interesting fact: The shortest route is not always the best route. A path with fewer stations can feel worse if it requires multiple interchanges.A slightly longer route can feel easier if you st... 4 min read · [akshatjme.hashnode.dev](https://akshatjme.hashnode.dev/optimal-route-planning-in-delhi-metro-using-graph-algorithms?utm_source=hashnode&utm_medium=feed) [William Huston](https://hashnode.com/@WilliamHuston) · [Oct 1, 2025](https://hashnode.com/posts/20-edsger-dijkstra-the-algorithim-and-its-creator/68dc779d157bc60adc7a1faf) ### [20 - Edsger Dijkstra: The Algorithim and Its Creator](https://thequantumnode.hashnode.dev/20-edsger-dijkstra-the-algorithim-and-its-creator?utm_source=hashnode&utm_medium=feed) As an engineer, learning routing protocols led me to the question of how routing developed. The answer brought me to the doorstep of Edsger Dijkstra. 4 min read · [thequantumnode.hashnode.dev](https://thequantumnode.hashnode.dev/20-edsger-dijkstra-the-algorithim-and-its-creator?utm_source=hashnode&utm_medium=feed) [Vanshita](https://hashnode.com/@itsvanshita11) · [Aug 19, 2025](https://hashnode.com/posts/when-old-meets-new-dijkstra-vs-tsinghuas-breakthrough-in-shortest-path-algorithms/68a40ac3733e6a634251b20b) ### [When Old Meets New: Dijkstra vs. Tsinghua’s Breakthrough in Shortest Path Algorithms](https://vanshitalearns.hashnode.dev/when-old-meets-new-dijkstra-vs-tsinghuas-breakthrough-in-shortest-path-algorithms?utm_source=hashnode&utm_medium=feed) How Chinese Scientists Revolutionized Shortest Path Algorithms with Real-Life Impact 3 min read · [vanshitalearns.hashnode.dev](https://vanshitalearns.hashnode.dev/when-old-meets-new-dijkstra-vs-tsinghuas-breakthrough-in-shortest-path-algorithms?utm_source=hashnode&utm_medium=feed) [EJ Jung](https://hashnode.com/@ejjung) · [Aug 14, 2025](https://hashnode.com/posts/algorithms-shortest-path-algorithms/689e7190a72760b71b2cd6f0) ### [Understanding Shortest Path Algorithms: Dijkstra, Bellman-Ford, and Floyd-Warshall Explained](https://ejjung.hashnode.dev/algorithms-shortest-path-algorithms?utm_source=hashnode&utm_medium=feed) Study Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms for shortest path solutions in graphs with different constraints and applications 4 min read · [ejjung.hashnode.dev](https://ejjung.hashnode.dev/algorithms-shortest-path-algorithms?utm_source=hashnode&utm_medium=feed) [Nemanja Mitic](https://hashnode.com/@nemanjam) · [Aug 5, 2025](https://hashnode.com/posts/comparing-bfs-dfs-dijkstra-and-a-algorithms-on-a-practical-maze-solver-example/68920c0900827ceee5780dfb) ### [Comparing BFS, DFS, Dijkstra, and A\* algorithms on a practical maze solver example](https://nemanjam.hashnode.dev/comparing-bfs-dfs-dijkstra-and-a-algorithms-on-a-practical-maze-solver-example?utm_source=hashnode&utm_medium=feed) Understanding the strengths and trade-offs of core pathfinding algorithms through a practical maze example. Demo app included. 8 min read · [nemanjam.hashnode.dev](https://nemanjam.hashnode.dev/comparing-bfs-dfs-dijkstra-and-a-algorithms-on-a-practical-maze-solver-example?utm_source=hashnode&utm_medium=feed)