--- title: "#shortestpath articles | Hashnode" description: "Explore 10 articles tagged #shortestpath on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/shortestpath" --- Tag # #shortestpath 10 posts · 0 followers [Chetan Datta](https://hashnode.com/@chetan77) · [Sep 7, 2025](https://hashnode.com/posts/shortest-path-in-directed-acyclic-graph/68bd81e905892f525c2aa82a) ### [Shortest path in Directed Acyclic Graph](https://chetan77.hashnode.dev/shortest-path-in-directed-acyclic-graph?utm_source=hashnode&utm_medium=feed) 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... 3 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/shortest-path-in-directed-acyclic-graph?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 16, 2025](https://hashnode.com/posts/when-depth-first-search-gets-it-wrong-shortest-path-problem-analysis/68774b5abb9dd852b747278b) ### [When Depth-First Search Gets It Wrong: Shortest Path Problem Analysis](https://huanganni.hashnode.dev/when-depth-first-search-gets-it-wrong-shortest-path-problem-analysis?utm_source=hashnode&utm_medium=feed) Demonstrated Through Singapore's MRT System 9 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/when-depth-first-search-gets-it-wrong-shortest-path-problem-analysis?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 15, 2025](https://hashnode.com/posts/can-we-always-change-bfs-solution-to-dfs-solution/6875b0eb1227c3bb3de604d9) ### [Can we always change BFS solution to DFS solution?](https://huanganni.hashnode.dev/can-we-always-change-bfs-solution-to-dfs-solution?utm_source=hashnode&utm_medium=feed) There are some scenarios which you must use BFS or DFS 6 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/can-we-always-change-bfs-solution-to-dfs-solution?utm_source=hashnode&utm_medium=feed) [VeiledLogic](https://hashnode.com/@veiledlogic) · [May 7, 2025](https://hashnode.com/posts/leetcode-problem-3341-find-minimum-time-to-reach-last-room/681b229212ae7e6190943b89) ### [LeetCode Problem 3341: Find Minimum Time to Reach Last Room](https://leetcode-veiledlogic.hashnode.dev/leetcode-problem-3341-find-minimum-time-to-reach-last-room?utm_source=hashnode&utm_medium=feed) 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... 4 min read · [leetcode-veiledlogic.hashnode.dev](https://leetcode-veiledlogic.hashnode.dev/leetcode-problem-3341-find-minimum-time-to-reach-last-room?utm_source=hashnode&utm_medium=feed) [Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/dijkstras-algorithm-finding-the-shortest-path/6781e98e433844ae7581ce68) ### [Dijkstra’s Algorithm: Finding the Shortest Path](https://blogs.arkainfotech.in/dijkstras-algorithm-finding-the-shortest-path?utm_source=hashnode&utm_medium=feed) Dijkstra’s Algorithm finds shortest paths in graphs, with Python examples and applications in navigation, networking, and optimization 4 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/dijkstras-algorithm-finding-the-shortest-path?utm_source=hashnode&utm_medium=feed) [Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/bellman-ford-algorithm-vs-dijkstra-a-comparison/6781e9eb9a711127f2851b5c) ### [Bellman-Ford Algorithm vs Dijkstra: A Comparison](https://blogs.arkainfotech.in/bellman-ford-algorithm-vs-dijkstra-a-comparison?utm_source=hashnode&utm_medium=feed) Bellman-Ford handles negative weights; Dijkstra doesn't. Bellman-Ford: O(VE), Dijkstra: O(V^2). Use Bellman-Ford for negative cycles 5 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/bellman-ford-algorithm-vs-dijkstra-a-comparison?utm_source=hashnode&utm_medium=feed) [Mehreen Mallick Fiona](https://hashnode.com/@mehreen13) · [Sep 5, 2024](https://hashnode.com/posts/finding-the-shortest-route-exploring-dijkstras-algorithm/66d9c7ea32f6caf8977d8a9c) ### [Finding the Shortest Route: Exploring Dijkstra's Algorithm](https://rosiechan.hashnode.dev/finding-the-shortest-route-exploring-dijkstras-algorithm?utm_source=hashnode&utm_medium=feed) Discover How Dijkstra's Algorithm Finds the Quickest Path in Complex Graphs 4 min read · [rosiechan.hashnode.dev](https://rosiechan.hashnode.dev/finding-the-shortest-route-exploring-dijkstras-algorithm?utm_source=hashnode&utm_medium=feed) [Fatima Jannet](https://hashnode.com/@fatimaJannet) · [Aug 22, 2024](https://hashnode.com/posts/shortest-path-single-source-and-all-pairs/66c78394efa91dd3927f664f) ### [Shortest Path: Single Source and All Pairs](https://mahia.hashnode.dev/shortest-path-single-source-and-all-pairs?utm_source=hashnode&utm_medium=feed) 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... 3 min read · [mahia.hashnode.dev](https://mahia.hashnode.dev/shortest-path-single-source-and-all-pairs?utm_source=hashnode&utm_medium=feed) [khandoker anan](https://hashnode.com/@khandokeranan) · [Sep 1, 2023](https://hashnode.com/posts/single-source-shortest-path/64f26de23bd33f93cee20bec) ### [Popular algorithm and passings for single source shortest path](https://blog.khandokeranan.com/single-source-shortest-path?utm_source=hashnode&utm_medium=feed) 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 ... 10 min read · [blog.khandokeranan.com](https://blog.khandokeranan.com/single-source-shortest-path?utm_source=hashnode&utm_medium=feed) [khandoker anan](https://hashnode.com/@khandokeranan) · [May 6, 2023](https://hashnode.com/posts/finding-the-shortest-path-with-topological-sort-in-directed-acyclic-graph/64564050d5451f391079ea45) ### [Finding the shortest path with topological sort in Directed Acyclic Graph](https://blog.khandokeranan.com/finding-the-shortest-path-with-topological-sort-in-directed-acyclic-graph?utm_source=hashnode&utm_medium=feed) 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... 6 min read · [blog.khandokeranan.com](https://blog.khandokeranan.com/finding-the-shortest-path-with-topological-sort-in-directed-acyclic-graph?utm_source=hashnode&utm_medium=feed)