LLim Woojae·Jul 22[CS fundamentals] Greedy - Dijkstra, Kruskal and Prim's AlgorithmThink about how Google Maps finds the shortest path from your home to your favorite restaurant. Each traffic light might represent a vertex of a graph6 min read·jaylog.hashnode.dev
BBeau Carnes·Jul 16Understanding Dijkstra's AlgorithmIn 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 co2 min read·freecodecamp.org
AAlex Mateo·May 10Graph Algorithms for Coding Interviews: When to Use BFS, DFS, or DijkstraLearn 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
YYejun Park·May 8The Banker's Algorithm: How Operating Systems Avoid DeadlockA beginner-friendly guide to one of the most elegant ideas in computer science6 min read·yejunpark3.hashnode.dev
AAanya Kathuria·Mar 31Why Recomputing Shortest Paths Is Inefficient: A Step Towards Smarter Graph AlgorithmsA Step Towards Smarter Graph Algorithms5 min read·graphnotes.hashnode.dev1
AAkshat Jain·Mar 7Optimal Route Planning in Delhi Metro Using Graph AlgorithmsAnyone 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
WWilliam Huston·Oct 1, 202520 - Edsger Dijkstra: The Algorithim and Its CreatorAs 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
VVanshita·Aug 19, 2025When Old Meets New: Dijkstra vs. Tsinghua’s Breakthrough in Shortest Path AlgorithmsHow Chinese Scientists Revolutionized Shortest Path Algorithms with Real-Life Impact3 min read·vanshitalearns.hashnode.dev
EEJ Jung·Aug 14, 2025Understanding Shortest Path Algorithms: Dijkstra, Bellman-Ford, and Floyd-Warshall ExplainedStudy Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms for shortest path solutions in graphs with different constraints and applications4 min read·ejjung.hashnode.dev
NNemanja Mitic·Aug 5, 2025Comparing BFS, DFS, Dijkstra, and A* algorithms on a practical maze solver exampleUnderstanding the strengths and trade-offs of core pathfinding algorithms through a practical maze example. Demo app included.8 min read·nemanjam.hashnode.dev
