---
title: "#graph-algorithms articles | Hashnode"
description: "Explore 40 articles tagged #graph-algorithms on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/graph-algorithms"
---

Tag

# #graph-algorithms

40 posts · 0 followers

[Abstract Algorithms](https://hashnode.com/@abstractalgorithms) · [Jun 18](https://hashnode.com/posts/advanced-graph-algorithms-for-interviews/6a34358cfceb577e6f1591c1)

### [Advanced Graph Algorithms: Dijkstra, Topological Sort, and Disjoint Set Union (DSU)](https://abstractalgorithms.hashnode.dev/advanced-graph-algorithms-for-interviews?utm_source=hashnode&utm_medium=feed)

Master shortest paths, dependency resolution, and cycle detection with robust Java solutions.

12 min read · [abstractalgorithms.hashnode.dev](https://abstractalgorithms.hashnode.dev/advanced-graph-algorithms-for-interviews?utm_source=hashnode&utm_medium=feed)

[Tanya Agarwal](https://hashnode.com/@tanya2) · [Jun 6](https://hashnode.com/posts/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs/6a2412583480bd6272ebc1c9)

### [Building a Graph-Based Job Recommendation System using BFS and DFS](https://tanyacodes.hashnode.dev/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs?utm_source=hashnode&utm_medium=feed)

Introduction Finding the right job opportunity based on a person's skills can be challenging. Many students and professionals struggle to identify career paths that align with their expertise. To addr

5 min read · [tanyacodes.hashnode.dev](https://tanyacodes.hashnode.dev/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs?utm_source=hashnode&utm_medium=feed)

[Abstract Algorithms](https://hashnode.com/@abstractalgorithms) · [Mar 29](https://hashnode.com/posts/bfs-breadth-first-search/69c8c223c68e9f488979d553)

### [BFS — Breadth-First Search: Level-by-Level Graph Exploration](https://abstractalgorithms.hashnode.dev/bfs-breadth-first-search?utm_source=hashnode&utm_medium=feed)

BFS explores graphs level by level using a queue — the key to shortest paths and level-order problems.

16 min read · [abstractalgorithms.hashnode.dev](https://abstractalgorithms.hashnode.dev/bfs-breadth-first-search?utm_source=hashnode&utm_medium=feed)

[Abstract Algorithms](https://hashnode.com/@abstractalgorithms) · [Mar 29](https://hashnode.com/posts/dfs-depth-first-search/69c8c23065eda86098e25eb7)

### [DFS — Depth-First Search: Go Deep Before Going Wide](https://abstractalgorithms.hashnode.dev/dfs-depth-first-search?utm_source=hashnode&utm_medium=feed)

DFS explores graphs by going as deep as possible before backtracking — the key to cycle detection and path search.

15 min read · [abstractalgorithms.hashnode.dev](https://abstractalgorithms.hashnode.dev/dfs-depth-first-search?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)

[Squareword](https://hashnode.com/@Squareword) · [Nov 6, 2025](https://hashnode.com/posts/desmos-calculator-a-smart-way-to-visualize-and-understand-math/690c752baec275437c83429e)

### [Desmos Calculator: A Smart Way to Visualize and Understand Math](https://squareword.hashnode.dev/desmos-calculator-a-smart-way-to-visualize-and-understand-math?utm_source=hashnode&utm_medium=feed)

The Desmos Calculator has become an essential tool for students, teachers, and anyone who works with mathematics.

3 min read · [squareword.hashnode.dev](https://squareword.hashnode.dev/desmos-calculator-a-smart-way-to-visualize-and-understand-math?utm_source=hashnode&utm_medium=feed)

[Programming Blogs](https://hashnode.com/@saberazinia) · [Aug 22, 2025](https://hashnode.com/posts/breath-first-search-bfs-in-python/68a8f11de386d4034fbc8dc4)

### [Breath First Search (BFS) in Python](https://worldofprogramming.hashnode.dev/breath-first-search-bfs-in-python?utm_source=hashnode&utm_medium=feed)

Learn how to implement Breath First Search (BFS) in Python to find the shortest path in a graph efficiently

3 min read · [worldofprogramming.hashnode.dev](https://worldofprogramming.hashnode.dev/breath-first-search-bfs-in-python?utm_source=hashnode&utm_medium=feed)

[Gantogtokh Oyundalai](https://hashnode.com/@oganaa2472) · [Aug 19, 2025](https://hashnode.com/posts/graph-problems-for-practice/68a4d70529b60e22c5c3b596)

### [Graph Problems For Practice](https://oganaa.hashnode.dev/graph-problems-for-practice?utm_source=hashnode&utm_medium=feed)

Graph for beginner, including Union Find dsa,Bfs,Dfs,Bipartite, Cycle Find, Topological Sort,Shortest Path(Bellman Ford/ Djkstra)

7 min read · [oganaa.hashnode.dev](https://oganaa.hashnode.dev/graph-problems-for-practice?utm_source=hashnode&utm_medium=feed)

[Natallia Vasilyeva](https://hashnode.com/@reestr) · [Jul 20, 2025](https://hashnode.com/posts/weirdflows-detection-fraud-topological-patterns/687cfb86d81187a07aee331f)

### [The Geometry of Deception](https://reestr.blog/weirdflows-detection-fraud-topological-patterns?utm_source=hashnode&utm_medium=feed)

WeirdFlows doesn’t search for fraud. It detects the shape of it. Inside a European bank, a pattern too perfect to be real exposed the next frontier of laund

3 min read · [reestr.blog](https://reestr.blog/weirdflows-detection-fraud-topological-patterns?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)
