Tag feed

#shortestpath

10 posts0 followers

Explore Hashnode

Alternatives

Trending tags this week

CDChetan Dattachetan77.hashnode.devSep 7, 2025 · 3 min read

Shortest path in Directed Acyclic Graph

Problem Given a Directed Acyclic Graph of V vertices from 0 to n-1 and a 2D Integer array(or vector) edges[ ][ ] of length E, where there is a directed edge from edge[i][0] to edge[i][1] with a distance of edge[i][2] for all i. (Geeks) Find the short...

0

AHAnni Huanghuanganni.hashnode.devJul 16, 2025 · 9 min read

When Depth-First Search Gets It Wrong: Shortest Path Problem Analysis

While working on a recent graph traversal problem, I made an assumption that would prove costly: that Depth-First Search (DFS) and Breadth-First Search (BFS) are interchangeable algorithms. This misconception led me down a rabbit hole of debugging be...

0

AHAnni Huanghuanganni.hashnode.devJul 15, 2025 · 6 min read

Can we always change BFS solution to DFS solution?

When to Use BFS vs DFS Use BFS when: Shortest Path in Unweighted Graphs - BFS guarantees the shortest path because it explores nodes level by level Level-order Traversal - When you need to process nodes level by level Finding Minimum Steps - Any pro...

0

VVeiledLogicleetcode-veiledlogic.hashnode.devMay 7, 2025 · 4 min read

LeetCode Problem 3341: Find Minimum Time to Reach Last Room

Problem Overview: Navigating a Time-Locked Dungeon Grid Imagine you're trapped in a dungeon that looks like a grid. Each cell in the grid represents a room. Some rooms are instantly accessible, while others are locked and only become accessible after...

0

AIArka Infotechblogs.arkainfotech.inJan 11, 2025 · 4 min read

Dijkstra’s Algorithm: Finding the Shortest Path

Introduction Dijkstra's Algorithm is one of the most widely used algorithms in graph theory. It efficiently finds the shortest path from a source vertex to all other vertices in a weighted graph. Named after Edsger W. Dijkstra, who introduced it in 1...

0

AIArka Infotechblogs.arkainfotech.inJan 11, 2025 · 5 min read

Bellman-Ford Algorithm vs Dijkstra: A Comparison

Introduction When solving shortest path problems in graph theory, Bellman-Ford Algorithm and Dijkstra’s Algorithm are two of the most prominent approaches. While both aim to find the shortest path from a source node to other nodes in a graph, their m...

0

MMMehreen Mallick Fionarosiechan.hashnode.devSep 5, 2024 · 4 min read

Finding the Shortest Route: Exploring Dijkstra's Algorithm

What is Dijkstra's Algorithm? Dijkstra's Algorithm is a renowned algorithm used to find the shortest paths between nodes in a graph. It is widely used in routing and as a foundation for various network-related applications. Whether you're navigating ...

0

FJFatima Jannetmahia.hashnode.devAug 22, 2024 · 3 min read

Shortest Path: Single Source and All Pairs

I will be covering two types of path here. Lets' start! Single Source Shortest Path A single source problem is about finding a path between a given vertex (called source) to all other vertices in graph such that the total distance between them (sourc...

0

KAkhandoker ananblog.khandokeranan.comSep 1, 2023 · 10 min read

Popular algorithm and passings for single source shortest path

Three commonly used methods for determining the shortest path from a single starting node require a fundamental understanding of graphs. These algorithms are as follows: Shortest path in a Directed Acyclic Graph (DAG) using topological sorting The ...

0

KAkhandoker ananblog.khandokeranan.comMay 6, 2023 · 6 min read

Finding the shortest path with topological sort in Directed Acyclic Graph

Introduction In a directed acyclic graph (DAG), a topological sort is a linear ordering of the vertices such that for every directed edge, the vertex u comes before v in the ordering. This ordering can be used to find the shortest path between two ve...

0

#shortestpath

Search Hashnode

#shortestpath

Explore Hashnode

Trending tags this week

Shortest path in Directed Acyclic Graph

When Depth-First Search Gets It Wrong: Shortest Path Problem Analysis

Can we always change BFS solution to DFS solution?

LeetCode Problem 3341: Find Minimum Time to Reach Last Room

Dijkstra’s Algorithm: Finding the Shortest Path

Bellman-Ford Algorithm vs Dijkstra: A Comparison

Finding the Shortest Route: Exploring Dijkstra's Algorithm

Shortest Path: Single Source and All Pairs

Popular algorithm and passings for single source shortest path

Finding the shortest path with topological sort in Directed Acyclic Graph