Tag feed

#dijkstra

29 posts0 followers

Explore Hashnode

Alternatives

Trending tags this week

AMAlex Mateoalexmateo.hashnode.devMay 10 · 11 min read

Graph Algorithms for Coding Interviews: When to Use BFS, DFS, or Dijkstra

Graphs are the most feared topic in coding interviews — not because they're impossible, but because most people learn the algorithms in isolation without understanding when to use each one. This guide

0

YPYejun Parkyejunpark3.hashnode.devMay 8 · 6 min read

The Banker's Algorithm: How Operating Systems Avoid Deadlock

The Problem: When Everyone Is Waiting for Everyone Imagine four cars arriving at a four-way intersection at the same time. Each driver inches forward, blocking the others. Nobody can move. Nobody will

0

AKAanya Kathuriagraphnotes.hashnode.devMar 31 · 5 min read

Why Recomputing Shortest Paths Is Inefficient: A Step Towards Smarter Graph Algorithms

Imagine that you are using Google Maps while you are driving somewhere, and suddenly there's a road blockage. In this case Google Maps quickly reroutes and gives a new route where there is no blockage

0

AJAkshat Jainakshatjme.hashnode.devMar 7 · 4 min read

Optimal Route Planning in Delhi Metro Using Graph Algorithms

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...

0

WHWilliam Hustonthequantumnode.hashnode.devOct 1, 2025 · 4 min read

20 - Edsger Dijkstra: The Algorithim and Its Creator

Admiration of a Mathematician Growing up, I loved sports, and my favorite people were athletes. Their discipline, teamwork, and determination inspired me. However, as I matured, I still respected their grit and discipline, but I entered the engineeri...

0

TTheSimpsonssvanshitalearns.hashnode.devAug 19, 2025 · 3 min read

When Old Meets New: Dijkstra vs. Tsinghua’s Breakthrough in Shortest Path Algorithms

Introduction Algorithms power our everyday life — from unlocking your phone with a fingerprint to finding the fastest route on Google Maps. One of the most widely used algorithms in pathfinding and navigation is Dijkstra’s algorithm, introduced in 19...

0

EJEJ Jungejjung.hashnode.devAug 14, 2025 · 4 min read

Understanding Shortest Path Algorithms: Dijkstra, Bellman-Ford, and Floyd-Warshall Explained

1. Introduction Shortest path algorithms are fundamental in graph theory and computer science, with wide applications ranging from GPS navigation systems to network routing protocols. This article covers three major algorithms: Dijkstra's Algorithm:...

0

NMNemanja Miticnemanjam.hashnode.devAug 5, 2025 · 8 min read

Comparing BFS, DFS, Dijkstra, and A* algorithms on a practical maze solver example

Introduction Pathfinding is a fundamental topic in computer science, with applications in fields like navigation, AI/ML, network routing, and many others. In this article, we compare four core pathfinding algorithms: breadth-first search (BFS), depth...

0

GKgayatri kumargeekee.hashnode.devJun 23, 2025 · 9 min read

Dijkstra’s Algorithm: Ants Finding the Easiest Route

Introduction to Dijkstra’s Algorithm: Finding the Easiest Path In a sprawling ant colony, some tunnels are easy to travel through, while others are rugged or filled with obstacles. When an ant seeks the easiest path to reach food, it needs a way to n...

0

TBTanayendu Baridijkstras-is-no-longer-the-fastest-path.hashnode.devJun 17, 2025 · 3 min read

A Faster SSSP Algorithm for Directed Graphs.

Introduction Finding the shortest path from one node to all others in a graph is a core building block in computer science. Since 1959, Dijkstra’s algorithm has been the go-to solution for graphs with non-negative weights. It runs in O(m + n log n) t...

0

#dijkstra

Search Hashnode

#dijkstra

Explore Hashnode

Trending tags this week

Graph Algorithms for Coding Interviews: When to Use BFS, DFS, or Dijkstra

The Banker's Algorithm: How Operating Systems Avoid Deadlock

Why Recomputing Shortest Paths Is Inefficient: A Step Towards Smarter Graph Algorithms

Optimal Route Planning in Delhi Metro Using Graph Algorithms

20 - Edsger Dijkstra: The Algorithim and Its Creator

When Old Meets New: Dijkstra vs. Tsinghua’s Breakthrough in Shortest Path Algorithms

Understanding Shortest Path Algorithms: Dijkstra, Bellman-Ford, and Floyd-Warshall Explained

Comparing BFS, DFS, Dijkstra, and A* algorithms on a practical maze solver example

Dijkstra’s Algorithm: Ants Finding the Easiest Route

A Faster SSSP Algorithm for Directed Graphs.